Bajaj Finserv Health Interview Questions, Process, and Tips

Q1. Basic DSA questions
Add your answer

Q1. Your background and resume based.
Add your answer

Q1. Basic Information on Experience
Add your answer

Q1. Asked to Explain about Experience and Why this career
Add your answer

Q1. Presentation on Sales
Add your answer

Q1. 2sum problem leetcode,
Add your answer
Q2. What is the angle between minute and hour hand at 1:15
Ans. 
The angle between the minute and hour hand at 1:15 is 7.5 degrees.
• At 1:15, the minute hand is at 3 and the hour hand is slightly past 1

• Calculate the angles covered by each hand from 12 o'clock position

• Subtract the smaller angle from the larger angle to get the angle between the hands
Answered by AI
Add your answer

Q1. Project based fully
Add your answer
Q2. All technical questions related to tech stack - nodejs
Add your answer

Q1. Asked about CV & other stuff
Add your answer

Case study on Google reviews

Q1. Last formal round with CPO
Add your answer

Q1. One by one taking interview
Add your answer
Q2. Tell me about Your self and other question about previous work and life
Add your answer

Q1. We were given an API documentation for an endpoint which accepts a POST request. The request body must contain only college Id number as payload. Every candidate must hit the endpoint with their college id...read more
Add your answer

Q1. Javascript based interview questions
Add your answer

Q1. React based technical questions
Add your answer

Round duration - No duration
Round difficulty - Easy

Round duration - 90 minutes
Round difficulty - Medium

It was a day test conducted on hackerearth. There were few mcqs and 2 coding questions.

Q1. 
Ninja And The Fence Problem Statement
Ninja is given a task of painting a fence with ‘N’ posts using ‘K’ different colors. The task requires that not more than two adjacent posts have the same color. Your...read more
Ans. 
The task is to determine the number of ways to paint a fence with 'N' posts using 'K' different colors, with the constraint that not more than two adjacent posts have the same color.
• Use dynamic programming to solve the problem efficiently.

• Consider the cases where the last two posts have the same color and different colors separately.

• Keep track of the number of ways to paint the fence at each post using a 2D array.

• Apply...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was a face to face round with Senior Software Engineer. The topic of discussion was Data Structures, Reactjs, the projects I've made and basic web development.
I was given array question to solve and my javascript skills were tested.
There was a good discussion over my major projects and the work I've done.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
Reverse a given string containing alphabets, numbers, and special characters.
• Iterate through the string from the end to the beginning and append each character to a new string.

• Use built-in functions like reverse() or slicing to reverse the string.

• Handle special characters and numbers while reversing the string.

• Ensure to consider the constraints on the length of the string and number of test cases.
Answered by AI
Add your answer
Q2. 
Count Pairs with Given Sum
Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
Input:
The first line c...read more
Ans. 
Count the total number of unique pairs in an array whose elements sum up to a given value.
• Use a hashmap to store the frequency of each element in the array.

• Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.

• Increment the count of pairs if the complement exists in the hashmap.

• Divide the count by 2 to avoid counting duplicates like (arr[i], arr[j]) and (arr[j], arr[i])
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

It was a face to face interaction with Tech Lead. Most of the discussion was over Javascript and Reactjs to test my indepth knowledge of basics and advance concepts. Also, questions and discussion on arrays, strings, maps, optimization was there.
There were several questions on OOPS, javascript and reactjs.

Q1. 
Delete a Node from Linked List Problem Statement
Given a linked list of integers, your task is to implement a function that deletes a node at a specified position, 'POS'.
If the specified position is gre...read more
Ans. 
Implement a function to delete a node at a specified position in a linked list.
• Traverse the linked list to find the node at the specified position.

• Update the pointers to skip over the node to be deleted.

• Handle edge cases like deleting the head or tail of the linked list.

• Return the modified linked list.
Answered by AI
Add your answer

Round duration - 10 minutes
Round difficulty - Easy

It was an easy round with the HR of the company. We had a normal discussion over my work and future expeditions and student life.