i
Bajaj Finserv Health
Filter interviews by
I applied via Campus Placement and was interviewed before Jul 2023. There were 2 interview rounds.
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
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
I appeared for an interview in Mar 2022.
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.
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...
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...
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.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
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.
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'.
The first line c...
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])
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.
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...
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.
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.
Tip 1 : Be consistent. Make a schedule to atleast do 3-5 questions daily no matter how busy the schedule is. This will help to make routine and soon you will start seeing your growth.
Tip 2 : Explore. Keep exploring and have the interest to learn. Web Development is something that more you explore and more you practice, the more you will ace.
Tip 3 : Participate in more events and hackathons. This will add up to your experience and you will network with a lot of people.
Tip 1 : Don't add a long list of projects. Just add 2-3 of your best projects that will define your total knowledge and work you have done. Even 1 major project will define your work but it should be a great one.
Tip 2 : Never lie on your resume. Only add the skills that you believe you have or you will learn and grasp quickly.
Tip 3 : Be specific about your details and do not write long paragraphs to define your experiences.
Bajaj Finserv Health interview questions for popular designations
I applied via Campus Placement and was interviewed before Jan 2022. There were 4 interview rounds.
A problem was provided with respect to different domains of the company and asked the candidates to build a strategy according to that.
I applied via Campus Placement and was interviewed in Mar 2022. There were 4 interview rounds.
There were 4 profiles
Frontend
Backend
Data science
Salesforce
And for each of them a related task was given.
Consisted of 2 coding questions with 30 MCQs
I applied via Naukri.com and was interviewed in Mar 2021. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
There were a total of three questions of 100, 200, and 300 points respectively. Partial points were given if partial tests got passed for any problem. The Codesignal environment was similar to Hackerrank, so not much different. I think the test was held in the afternoon time.
Two players, 'Ale' and 'Bob', are playing a game with a pile of stones. Your task is to determine the winner if both play optimally.
1. On each turn, ...
Determining the winner of a game where two players take turns to remove stones from a pile based on certain rules.
Implement a recursive function to simulate the game where each player makes the optimal move.
Check if the current player can take any stones, if not, the other player wins.
Return 'Ale' if 'Ale' wins, otherwise return 'Bob'.
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
A subset of an array 'ARR' is a tupl...
Given an array and an integer, return all subsets that sum to the given integer.
Use backtracking to generate all possible subsets of the array.
Keep track of the current subset and its sum while backtracking.
If the sum of the subset equals the target sum, add it to the result.
Recursively explore both including and excluding the current element in the subset.
Sort the elements in each subset to ensure increasing order of
Round duration - 60 minutes
Round difficulty - Medium
This round was a video call round held on Zoom and the Codesignal platform was to be used for coding the problems. The round started with the interviewer giving a small introduction about him and then asking me to introduce myself.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process of oranges.
Track the time taken to rot all oranges and return -1 if any fresh oranges remain.
Handle edge cases such as empty grid, no fresh oranges, or no rotten oranges.
Update the status of adjacent fresh oranges to rotten oranges in each iteration.
Given an integer array arr
of size N
, your task is to determine all indices of local minima and local maxima within the array. Return these indices in a 2-D list, ...
Find indices of local minima and maxima in an integer array.
Iterate through the array and compare each element with its neighbors to find local minima and maxima.
Consider corner elements separately by comparing with only one neighbor.
Return the indices of local minima and maxima in a 2-D list.
Round duration - 60 minutes
Round difficulty - Medium
The setup was exactly similar to the first interview round. The interviewer was very friendly. My advice will be to see the interviewer as a team mate and think you have to solve the question together with him. Don't panic and start speaking out what observations you can make about the problem.
Given an array or list ARR
of N
positive integers and an integer K
, your task is to rearrange all elements such that those with the K-th
bit (considering the rightmost bit as '1st' bit) eq...
Rearrange elements in an array based on the K-th bit being 0 or 1.
Iterate through the array and separate elements based on the K-th bit being 0 or 1.
Maintain the relative order of elements within each group.
Combine the two groups to get the final rearranged array.
Time complexity can be optimized to linear time by using bitwise operations.
Example: For ARR = {1, 2, 3, 4} and K = 1, output should be {2, 4, 1, 3}.
Round duration - 60 minutes
Round difficulty - Medium
It was already night time till this interview started because all the three interview rounds were held on the same day. This was not a DS+Algorithms round. He first asked me to introduce myself. So I started by telling what all I have done in my college up till now and then I told him about my internship experience at myKaarma which just ended few days back. There was around 10-15 minutes discussion on what I was working on in my intern project.
Tip 1 : Try to learn DS+Algorithms from the basics in the starting phase of your preparation. Though, in the later stages of the preparation, some cramming can be employed for the problems generally asked in the interviews (but that too with proper understanding)
Tip 2 : Don't forget to prepare topics like OS and OOP. Although I was not asked much about these topics but my friends were asked some questions from these topics. These topics can be prepared in 2-3 days from YouTube itself.
Tip 3 : For an intern role interview, 2-3 projects including the college projects should be enough. You should be prepared to explain your project answer the basic questions like the approach which you followed, the problems you faced during the project, etc.
Tip 4 : If possible you can have a prior intern experience as well, but one thing for sure, preparing DS+Algorithms is much more important than this.
Tip 1 : Writing things which you don't know about properly won't give you much benefit. Rather, they can get you into problem if asked about them.
Tip 2 : Writing much about the things like extra curricular activities in the resume for software roles don't give you much benefit in my opinion. Though I wrote 2-3 PORs which had.
Tip 3 : Trying to make your resume longer unnecessarily won't give you any benefit.
I appeared for an interview in Feb 2021.
Round duration - 24 hours
Round difficulty - Medium
Round duration - 120 Minutes
Round difficulty - Medium
It was a Data Structures and Algorithm Round and Discussion on My assignment round to check my Problem Solving Skills.
And the Interviewer was very friendly to me. I first introduced myself to the interviewer and what did I have done in past as a Software Engineer and Why I want to work in Grofers.
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
...Return the top view of a binary tree given in level-order format.
Traverse the binary tree in level-order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and return the nodes at the top view.
Handle null nodes by adjusting the horizontal distance accordingly.
Example: For the given binary tree, the top view will be {10, 4, 2, 1, 3, 6}.
Given an array ARR
consisting of exactly four integer digits, your task is to form the maximum possible valid time in a 24-hour format using those digits.
Given an array of four digits, form the maximum valid 24-hour time. Return -1 if not possible.
Iterate through all permutations of the digits to find the maximum valid time.
Check if the time is valid (between 00:00 and 23:59) before returning.
Handle cases where no valid time can be generated by returning -1.
Tip 1 : Practise Data Structures and Algorithms as much as you can on daily basis. Don't Fix numbers in your head, but practise as much as you can from all topics on daily basis.
Tip 2 : Give Programming Contests on a Daily basis. As it helps you to think of any particular problem in the fixed time frame.
Tip 3 : For Mastering DP, Learn From Aditya Verma Youtube Playlist and apply around 100 questions for solving any DP problem.
Tip 4 : Also Learn Computer Science theory subject once a week so that you will have a deep understanding of the particular subject since many interviews grind on CS theory subjects like OS, DBMS and Networks
Tip 5 : Make at least 2-3 Projects in any technology you like maybe Web Development or Android Development. It shows that you have some experience in Development and the company don't need to waste time on you for teaching frameworks.
Tip 6 : If you have time learn some System Design and learn how to design any system from end to end. Especially learn about designing a database of any application. In many interviews, the interviewer asks to design an application from end to end. So if you have some practice, then you can easily clear this type of rounds.
Tip 1 : Always attached your Project links in your resume. As it seems your project is genuine and you are confident in showing your projects
Tip 2 : Don't add unnecessary things in your resume which are not related to the job, like your 10th class winning tournament certificate or managing a college society. These things didn't create any impact on your profile and takes an unnecessary space in your resume.
Tip 3 : Always make a 1-page resume. If you are making more than 1 page then it means you have added a lot of unnecessary information which are not related to the job profile.
Tip 4 : Always show your Project and Past experience on top, just after your basic info and education. Since these are the things which should be on top to showcast the skills.
posted on 22 May 2022
I appeared for an interview in Aug 2021.
Round duration - 90 minutes
Round difficulty - Medium
The interview started in the evening on google meet. and extended for 90 minutes. The interviewer was very helpful and he shared a collaborative code editor to discuss several problems.
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.
If the complement exists, add the pair to the result. If not, add the current element to the hash set.
Handle cases where the same element is used twice in a pair by keeping track of the frequency of elements.
...
Given a binary tree of integers, convert the binary tree into a sum tree where each node's value is replaced by the sum of the values of its left and right subtrees in ...
Convert a binary tree into a sum tree where each node's value is replaced by the sum of its left and right subtrees.
Traverse the tree in postorder fashion to calculate the sum of left and right subtrees for each node.
Set leaf nodes to zero.
Update the node values with the sum of left and right subtrees.
Design and implement a Least Frequently Used (LFU) Cache with the following functionalities:
1. put(U__ID, value): Insert the value in the cache if the key ('U__ID') is not alrea...
Design and implement a Least Frequently Used (LFU) Cache with put and get functionalities, handling capacity and frequency of use.
Implement a LFU cache with put and get functions
Handle capacity and frequency of use for eviction
Return the value of key if present, -1 otherwise
Consider multiple elements with least frequency, remove least recently used
Example: Insert, update, and retrieve values based on operations
SQL query to find the X percentile of students
Use the NTILE() function to divide students into X groups
Calculate the total number of students and the number of students in each group
Select the students from the group that corresponds to the X percentile
Polymorphism is the ability of a function or method to behave differently based on the object it is called on.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
Real-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.
Run-time polymorphism is achieved through method overriding, where a subclass provide...
Tip 1 : Practice at-least 300 problems.
Tip 2 : Add at-least 2 projects and prepare them well for the interview.
Tip 3 : Practice mock interviews with your friends to learn how to explain problems.
Tip 1 : Follow some standard resume format and add 2-3 projects with explanations in point, also include technologies used in the project.
Tip 2 : Make sure you add all the technologies you are aware of in your resume and also, add links to competitive profiles (if you have good coding profiles).
Tip 3 : Add your achievements in the resume in points.
Some of the top questions asked at the Bajaj Finserv Health interview for freshers -
The duration of Bajaj Finserv Health interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 4 interviews
Interview experience
based on 207 reviews
Rating in categories
Product Manager
108
salaries
| ₹7.6 L/yr - ₹22.5 L/yr |
Software Development Engineer
68
salaries
| ₹9 L/yr - ₹18 L/yr |
Relationship Manager
43
salaries
| ₹4.2 L/yr - ₹8 L/yr |
Sales Manager
38
salaries
| ₹4.5 L/yr - ₹11.4 L/yr |
Senior Product Manager
32
salaries
| ₹18 L/yr - ₹30 L/yr |
Udaan
Swiggy
Eternal Limited
BlackBuck