i
CarDekho Group
Filter interviews by
I applied via Referral and was interviewed before May 2022. There were 4 interview rounds.
I was interviewed before Oct 2022.
Asked dome simple LinkedIn list and array questions.
I applied via Naukri.com and was interviewed in Sep 2021. There were 4 interview rounds.
Count the number of flips required to convert a binary string to alternate 0 and 1.
Iterate through the string and count the number of flips required to make it alternate.
Keep track of the current character and the expected character.
Example: 001101 -> 010101 requires 2 flips.
Example: 101010 -> 010101 requires 3 flips.
Find the maximum profit from buying and selling a stock given an array of its values.
Iterate through the array and keep track of the minimum value seen so far.
Calculate the profit at each index and update the maximum profit seen.
Return the maximum profit.
Boundary traversal of a tree
Boundary traversal involves visiting the nodes on the boundary of a tree in a specific order
Start with the root node and traverse the left boundary, then the leaf nodes from left to right, and finally the right boundary
Use recursion to traverse the left and right subtrees
Exclude the leaf nodes that are also part of the left or right boundary
Reverse a linked list in groups of k nodes.
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
Use recursion or iteration to implement the solution
I applied via Naukri.com and was interviewed in Oct 2023. There were 4 interview rounds.
It was a simple coding test.
There was a small coding problem involving oops concepts..
I applied via Recruitment Consulltant and was interviewed before Apr 2023. There were 3 interview rounds.
Basic baba questions and 3 short dsa problems
System Design interview, was asked to design a system like booking.com
Aptitude test was on hacker earth
No coding test was taken by the interviewrrwe
I applied via Naukri.com and was interviewed before Jul 2022. There were 3 interview rounds.
Implement binary search algorithm to find a target string in a sorted array of strings.
Ensure the array of strings is sorted before performing binary search.
Compare the target string with the middle element of the array and adjust the search range accordingly.
Repeat the process until the target string is found or the search range is exhausted.
I applied via Naukri.com and was interviewed before Mar 2022. There were 4 interview rounds.
I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.
Insert a node in a Binary Search Tree (BST)
Start at the root node and compare the value of the node to be inserted with the current node
If the value is less than the current node, move to the left child. If greater, move to the right child
Repeat the process until reaching a leaf node, then insert the new node as a left or right child
Design a lift system for efficient vertical transportation
Consider the number of floors in the building
Include safety features like emergency stop button
Optimize for speed and energy efficiency
Implement a user-friendly interface for passengers
based on 1 interview
Interview experience
Business Manager
198
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
183
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Retail Associate
119
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
94
salaries
| ₹0 L/yr - ₹0 L/yr |
Dealer Success Manager
93
salaries
| ₹0 L/yr - ₹0 L/yr |
Udaan
Indiamart Intermesh
BigBasket
Swiggy