i
Bajaj Finserv
Filter interviews by
Clear (1)
Easy ques to answer basic
Easy ques to write. not tough ques
Top trending discussions
I applied via Campus Placement and was interviewed before Sep 2020. There were 5 interview rounds.
posted on 24 Aug 2022
I applied via Recruitment Consulltant and was interviewed in Jul 2022. There were 4 interview rounds.
CodeVue coding test, one coding questions based on regular expressions
I applied via Campus Placement and was interviewed in Feb 2022. There were 3 interview rounds.
Two questions were asked one ease level one moderate level, both questions were based on dsa topics. I would highly recommend to solve leetcode easy and medium questions.
posted on 20 Sep 2022
I applied via Referral and was interviewed in Mar 2022. There were 3 interview rounds.
There was one coding round that contains one average type algo and we have to write the program for that.
posted on 17 Sep 2024
I applied via Referral and was interviewed in Aug 2024. There were 2 interview rounds.
Numpy arrays are more efficient for numerical operations compared to lists.
Numpy arrays are homogeneous in nature, while lists can contain different data types.
Numpy arrays support vectorized operations, making them faster for numerical computations.
Numpy arrays require less memory compared to lists for large datasets.
Example: np_array = np.array([1, 2, 3]) vs list = [1, 2, 3]
Merging two dataframes combines them into a single dataframe based on a common column or index.
Use the merge() function in pandas library in Python to merge dataframes
Specify the common column or index to merge on
Choose the type of join (inner, outer, left, right) based on your requirement
posted on 21 Oct 2024
I applied via Approached by Company and was interviewed in Sep 2024. There were 3 interview rounds.
Designing an AI parking management system to optimize parking space usage and improve efficiency.
Utilize sensors to detect available parking spaces in real-time
Implement machine learning algorithms to predict parking demand and optimize space allocation
Integrate with mobile apps for users to easily find and reserve parking spots
Use computer vision for license plate recognition and enforcement of parking rules
posted on 20 Dec 2021
I was interviewed in Nov 2021.
Round duration - 90 Minutes
Round difficulty - Medium
Chintu has a long binary string str
. A binary string is a string that contains only 0 and 1. He considers a string to be 'beautiful' if and only if the number of 0's ...
The task is to split a binary string into beautiful substrings with equal number of 0's and 1's.
Count the number of 0's and 1's in the string.
Iterate through the string and split it into beautiful substrings whenever the count of 0's and 1's becomes equal.
Return the maximum number of beautiful substrings that can be formed.
If it is not possible to split the string into beautiful substrings, return -1.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
Round duration - 100 Minutes
Round difficulty - Medium
It was a video interview in which 2 questions were asked u have 2 chances for each question to record your video. It was conducted on hirepro website.
Round duration - 35 Minutes
Round difficulty - Easy
The interviewer asked me to explain my project, 2 situation based questions and asked to solve a question on Trees
Given a binary tree, your task is to print the left view of the tree.
The input will be in level order form, with node values separated by a...
Print the left view of a binary tree given in level order form.
Traverse the tree level by level and print the first node of each level (leftmost node).
Use a queue to keep track of nodes at each level.
Time complexity should be O(n) where n is the number of nodes in the tree.
Round duration - 10 Minutes
Round difficulty - Easy
Tip 1 : Practice D.S.A
Tip 2 : Prepare your projects
Tip 3 : Be confident
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on a resume.
posted on 21 Feb 2022
I applied via LinkedIn and was interviewed in Jan 2022. There were 4 interview rounds.
4 Programming questions
10 MCQ
Each programming question has its own time allocated.
10 mins for MCQ.
C++ multithreading allows for concurrent execution of multiple threads within a single program.
Use mutexes to prevent race conditions and ensure thread safety
Avoid deadlocks by carefully managing locks and avoiding nested locks
Consider using condition variables to signal between threads
Use thread pools to manage and reuse threads efficiently
Be aware of potential performance issues and overhead with multithreading
I applied via Recruitment Consulltant and was interviewed in Mar 2022. There were 4 interview rounds.
based on 2 interviews
Interview experience
based on 7 reviews
Rating in categories
Assistant Manager
1.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Officer
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Manager
1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
866
salaries
| ₹0 L/yr - ₹0 L/yr |
HDFC Bank
ICICI Bank
Axis Bank
State Bank of India