Filter interviews by
Be the first one to contribute and help others!
I applied via Naukri.com and was interviewed in Feb 2020. There were 6 interview rounds.
I applied via Campus Placement and was interviewed before Aug 2020. There were 3 interview rounds.
I applied via Walk-in and was interviewed before Sep 2021. There were 2 interview rounds.
I want to join Bajaj Automobile because of their strong reputation in the industry and their commitment to innovation and customer satisfaction.
Bajaj Automobile has a strong reputation in the industry for producing high-quality vehicles.
They have a track record of innovation and introducing new technologies in their products.
Bajaj Automobile is known for their focus on customer satisfaction and providing excellent afte...
I applied via Naukri.com and was interviewed before May 2021. There were 4 interview rounds.
I have strong training skills in process, product, and gateway reviews.
I have experience in designing and delivering training programs for various processes and products.
I have conducted gateway reviews to ensure that the team is meeting the required standards.
I have used various training methods such as classroom training, on-the-job training, and e-learning.
I have also developed training materials such as manuals, pr...
I applied via Naukri.com and was interviewed in Sep 2021. There was 1 interview round.
I applied via Company Website and was interviewed in May 2019. There were 5 interview rounds.
I applied via Approached by Company and was interviewed in Aug 2017. There were 5 interview rounds.
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 11 reviews
Rating in categories
Driver
9
salaries
| ₹1 L/yr - ₹6 L/yr |
Account Assistant
7
salaries
| ₹1.1 L/yr - ₹3.6 L/yr |
Accountant
6
salaries
| ₹1.8 L/yr - ₹3.6 L/yr |
Transport Executive
6
salaries
| ₹1.6 L/yr - ₹5 L/yr |
Supervisor
6
salaries
| ₹2.3 L/yr - ₹2.5 L/yr |
Amazon
Mahindra & Mahindra
Delhivery
Ekart Logistics