i
CarDekho Group
Filter interviews by
I applied via Approached by Company and was interviewed in Feb 2023. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Dec 2021. There were 3 interview rounds.
I would immediately inform the project manager and the testing team about the error and work collaboratively to find a solution.
Notify the project manager and testing team about the error
Collaborate with the testing team to understand the issue
Analyze the code to identify the root cause of the error
Work with the development team to fix the error as quickly as possible
Perform thorough testing to ensure the issue is reso...
I applied via AmbitionBox and was interviewed before Sep 2020. There were 3 interview rounds.
Unique key allows null values, primary key does not.
Primary key is a unique identifier for a record in a table
Unique key allows null values, primary key does not
A table can have only one primary key, but multiple unique keys
Primary key is automatically indexed, unique key is not necessarily indexed
HAVING clause is used in SQL to filter data based on aggregate functions.
It is used with GROUP BY clause to filter data based on aggregate functions
It is used to filter data after grouping has been done
It is similar to WHERE clause but operates on grouped data
Example: SELECT department, AVG(salary) FROM employees GROUP BY department HAVING AVG(salary) > 50000;
CarDekho Group interview questions for designations
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.
I appeared for an interview before May 2021.
Round duration - 120 minutes
Round difficulty - Easy
It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium levels. Time was enough and no sectional time was present. 1-2 MCQs on SQL was also present.
Given a 2-dimensional boolean matrix mat
of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
Iterate through the matrix to find elements with value 1
Store the row and column indices of these elements
Update the entire row and column for each element found to be 1
Round duration - 60 minutes
Round difficulty - Easy
It was an online video interview round on HackerEarth with a simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class that required inheritance was asked by the interviewer to write. I was helped by the interviewer if I got stuck somewhere, Some questions on the implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.
Tip 1 : Clear basics
Tip 2 : Prepare well
Tip 3 : Do at-least 2 projects
Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly
I appeared for an interview before May 2021.
Round duration - 90 Minutes
Round difficulty - Medium
it was time bound coding test round. The questions were from array and string. There were 2 questions.
Determine whether a given string str
can be considered a K-Palindrome.
A string is considered a K-Palindrome if it can be transformed into a palindrome after removing up to...
The problem is to determine whether a given string can be considered a K-Palindrome by removing up to 'k' characters.
Iterate through the string from both ends and check if characters match, if not increment removal count
If removal count is less than or equal to k, return True, else return False
Use dynamic programming to optimize the solution by storing subproblem results
Round duration - 30 Minutes
Round difficulty - Easy
in this round manager spoke to me and explained about project and joining date later hr spoke to me regarding on boarding process
Tip 1 : Practise Data structures mostly (Array, String and Tree) , practise as much questions as you can.
Tip 2 : Have Good knowledge of Tech Stack you mention in your resume
Tip 3 : Have good understanding of projects mentioned in your resume.
Tip 1 : Resume should be having one page or maximum two pages long
Tip 2 : Mention your role on each project.
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round
based on 3 interviews
Interview experience
based on 7 reviews
Rating in categories
Business Manager
198
salaries
| ₹2.3 L/yr - ₹5 L/yr |
Key Account Manager
184
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
96
salaries
| ₹2.8 L/yr - ₹6.1 L/yr |
Assistant Manager
94
salaries
| ₹3.5 L/yr - ₹11.5 L/yr |
Udaan
Indiamart Intermesh
BigBasket
Swiggy