i
Bajaj Finserv Health
Filter interviews by
Clear (1)
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...
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.
Top trending discussions
posted on 25 Jul 2024
posted on 8 Feb 2024
.NET Framework is a software framework developed by Microsoft that provides a runtime environment for building and running applications.
.NET Framework is a platform for developing and running applications on Windows.
It includes a large library of pre-built code and a runtime environment for executing applications.
It supports multiple programming languages such as C#, VB.NET, and F#.
It provides features like memory mana...
Joins in SQL are used to combine rows from two or more tables based on a related column between them.
There are different types of joins in SQL: inner join, left join, right join, and full outer join.
Inner join returns only the matching rows from both tables.
Left join returns all the rows from the left table and the matching rows from the right table.
Right join returns all the rows from the right table and the matching ...
posted on 23 Jul 2024
A list of libraries used in software development.
Common libraries like React, Angular, jQuery
Backend libraries like Express, Django, Spring
Database libraries like Sequelize, SQLAlchemy, Hibernate
A physical file is a file stored on a physical storage device, such as a hard drive or solid-state drive.
Physical files are stored on physical storage devices like hard drives or SSDs.
They can be accessed and manipulated by software applications.
Examples include text documents, images, videos, and executable programs.
A batch job is a program that processes a large amount of data in a single run without user interaction.
Batch jobs are typically scheduled to run at specific times, often during off-peak hours.
They are commonly used for tasks such as data processing, report generation, and system maintenance.
Examples of batch job tools include cron in Unix/Linux systems and Task Scheduler in Windows.
An interactive job is a task or project that requires active participation and engagement from the user.
Interactive jobs involve real-time feedback and communication between the user and the system.
Examples include video games, online surveys, and interactive websites.
Users have control over the outcome of the task based on their input and decisions.
posted on 15 Oct 2023
I applied via Referral and was interviewed in Nov 2022. There were 5 interview rounds.
I am a software developer with 5 years of experience. I previously worked at XYZ Company as a full-stack developer.
5 years of experience in software development
Previous role as a full-stack developer at XYZ Company
Proficient in programming languages such as Java, Python, and JavaScript
SQL and coding questions
posted on 11 Jul 2024
I applied via Campus Placement and was interviewed in Jun 2024. There were 4 interview rounds.
There were 5 sections which included one coding question, MCQs and one question on SQL
A process is an instance of a program running on a computer, while a thread is a unit of execution within a process.
A process has its own memory space, while threads within the same process share memory.
Processes are independent of each other, while threads within the same process can communicate with each other more easily.
Processes are heavyweight in terms of resource consumption, while threads are lightweight.
Exampl...
A round manhole lid cannot fall through the opening it covers, unlike other shapes.
Round shape is the only shape that cannot fall through its own opening
Round shape is easier to move and position compared to other shapes
Round shape is more structurally sound and can support heavy loads evenly
The OSI model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.
The OSI model consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.
In real software development, layers commonly used are the Application layer, Transport layer, and sometimes the Network layer.
For example, when developing a web applica...
I was interviewed before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
I was interviewed in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
You are provided with two nodes,...
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
Round duration - 50 Minutes
Round difficulty - Easy
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
I was interviewed in Mar 2022.
Round duration - 120 Minutes
Round difficulty - Medium
Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach
Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question
Round duration - 60 Minutes
Round difficulty - Medium
2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
Use dynamic programming to solve the problem efficiently.
The number of structurally unique BSTs can be calculated using Catalan numbers.
For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.
Example: For N=3, the number of structurally unique BSTs is 5.
You are provided with a string 'STR'
that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain a current index to keep track of the characters being considered.
Append the current character to each subsequence generated so far.
Recursively call the function with the next index to include or exclude the next character.
Base case: When the current ind...
Round duration - 60 Minutes
Round difficulty - Easy
HIRING MANAGER ROUND
Discussion about the organisation now questions
Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly
Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Product Manager
117
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
65
salaries
| ₹0 L/yr - ₹0 L/yr |
Relationship Manager
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Manager
38
salaries
| ₹0 L/yr - ₹0 L/yr |
Salesforce Developer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Star Health & Allied Insurance
Niva Bupa Health Insurance Company
HDFC Ergo General Insurance
ICICI Lombard General Insurance Company