i
Bajaj Finserv Health
Filter interviews by
I was interviewed 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...
Approach: Say the function 'solve(n)' calculates how many ways to paint a fence with 'N' points and 'K' colors. we want to figure out the relationship between 'solve(n)' for 'N' points and with fewer points fence solutions like 'solve(n - 1)', 'solve(n - 2)', 'solve(n - 3)'.
Assume that both 'solve(n - 1)' and 'solve(n - 2)' are valid results, which means the last 2nd color is mush not e...
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...
Step 1 : I first applied normal iteration to reverse the string.
Step 2 : Then they updated the question and give a string expression to reverse.
Step 3 : I then converted it to char array and then reversed the individual word. The interviewer was happy with it.
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...
Step 1 : I applied O(n^2) approach firstly.
Step 2 : The interviewer asked to optimize but I cannot think at that moment.
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...
Step 1 : I first applied the native approach to iterate and find the previous and next node and the delete the given node.
Step 2 : I was asked to optimize and since I know the optimization so I used the recursive approach.
Step 3 : The interviewer was impressed over this.
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.
Top trending discussions
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Easy to medium level of leet code
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.
For Fibonacci series without recursion, use a loop to calculate the series.
For string palindrome, compare characters from start and end of the string.
To count all repeated numbers from the array, u
Rotate array to find max sum of i*A[i]
Rotate array to bring maximum element to front
Calculate sum of i*A[i] for each rotation
Keep track of maximum sum found
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Graphs ,arrays , Hashmaps and Heaps
Changes on graph structure involve adding, removing, or modifying nodes and edges.
Adding a new node to the graph
Removing an existing node from the graph
Modifying the weight of an edge in the graph
I applied via cuvette.tech and was interviewed before Sep 2022. There were 3 interview rounds.
Was asked to build a REST API for inventory management of a store using Django REST framework.
I was interviewed in May 2022.
Round duration - 150 minutes
Round difficulty - Medium
The interview was scheduled at 6 pm and the duration of the interview was 1.5 hrs but went for around 2.5 hrs. The interviewer started with a brief intro about me. Asked me some coding questions. After coding questions he started asking questions on dbms like difference between sql and no sql, what is horizontal and vertical scaling and when we use them. Then some questions on computer networks like how web browsers works, different between http and HTTPS, what is TCP. After this he asked about my projects and the technology I worked on during the intern.
Given a Snake and Ladder Board with 'N' rows and 'N' columns filled with numbers from 1 to N*N starting from the bottom left of the board, and alternating direction each...
You are given a Doubly Linked List with 'N' positive integers. Your task is to delete a node at a given position 'POS' in this linked list.
The first line of input ...
Round duration - 20 minutes
Round difficulty - Easy
Tip 1 : Study all the concepts of dbms and cn deeply
Tip 2 : Zomato focus on development, so you have to do some good projects or should have previous internship experience.
Tip 1 : Have good Projects
Tip 2 : Study all the topics deeply that u mentioned in your resume.
I was interviewed 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.
...As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...
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.
Approach:
Algorithm:
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.
I was interviewed before Sep 2020.
Round duration - 1 hour
Round difficulty - Medium
It was a 1 hour round on coding and problem solving.
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q
queries. Each query is represented by an integer Q[i]
, and you must ...
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Tip 1 : Always try to be clear with your basic concepts .As you are a fresher , you are expected to be clear with your basic concepts such as OOPS , MySql etc and also you should be able to explain it properly to the interviewer.
Tip 2 : Practice at least 200 Questions and the best platform for preparing is LeetCode.
Tip 3 : You should be clear with your projects and the technology it involved . 2-3 Projects are enough for the interview.
Tip 1 : Make neat resume with projects and internships mentioned.
Tip 2 : Mention only those things which are true.
Tip 3 : Do mention if you won any Hackathon.
I applied via campus placement at Kalinga Institute of Industrial Technology, Khurda and was interviewed in Sep 2023. There was 1 interview round.
3 Questions were asked out of which if you did 2 you were shortlisted for next round. Questions were mostly from topics like array, string and greedy
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Product Manager
117
salaries
| ₹9 L/yr - ₹25 L/yr |
Software Development Engineer
64
salaries
| ₹9 L/yr - ₹20.2 L/yr |
Relationship Manager
42
salaries
| ₹4.2 L/yr - ₹8 L/yr |
Sales Manager
38
salaries
| ₹4.5 L/yr - ₹11.4 L/yr |
Salesforce Developer
24
salaries
| ₹10 L/yr - ₹25 L/yr |
Star Health & Allied Insurance
Niva Bupa Health Insurance Company
HDFC Ergo General Insurance
ICICI Lombard General Insurance Company