i
CarDekho Group
Filter interviews by
I applied via Referral and was interviewed in Feb 2022. There was 1 interview round.
CarDekho faces issues with customer retention and competition. Solutions include improving customer service and implementing innovative marketing strategies.
Improve customer service to enhance customer satisfaction and loyalty
Implement innovative marketing strategies to stand out from competitors
Analyze competitors' strengths and weaknesses to identify opportunities for growth
Enhance online presence and user experience...
Top trending discussions
I applied via Campus Placement and was interviewed in Dec 2017. There was 0 interview round.
I applied via LinkedIn and was interviewed before May 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed before Jan 2021. There were 6 interview rounds.
I can sell you a pen by showing you how it can solve your problems and increase your productivity.
I understand that you need a pen to write down important information and ideas.
This pen has a comfortable grip and writes smoothly, making it easy to use for extended periods of time.
It also has a clip that can attach to your notebook or shirt pocket, ensuring that you always have it on hand.
By investing in this pen, you'l...
I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
I applied via Company Website and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Referral and was interviewed before Nov 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Medium
It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Array: [2,1,5,6,3,8], K ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order
Return the Kth element from the sorted array
Handle multiple test cases
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find the initial rotten oranges and add them to the queue.
Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.
Continue until the queue is empty, ke...
Round duration - 45 minutes
Round difficulty - Easy
This was a design round.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
Business Manager
194
salaries
| ₹2.3 L/yr - ₹5 L/yr |
Key Account Manager
185
salaries
| ₹2.5 L/yr - ₹9.2 L/yr |
Senior Retail Associate
119
salaries
| ₹3.3 L/yr - ₹5.5 L/yr |
Dealer Success Manager
97
salaries
| ₹2.8 L/yr - ₹6.9 L/yr |
Assistant Manager
94
salaries
| ₹3.5 L/yr - ₹11.5 L/yr |
Udaan
Indiamart Intermesh
BigBasket
Swiggy