AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
CarDekho
Group
Compare
Filter interviews by
CarDekho Group Software Development Engineer II Interview Questions and Answers
CarDekho Group Software Development Engineer II Interview Experiences
1 interview found
Anonymous
Selected
I applied via Instahyre and was interviewed before Jul 2023. There were 3 interview rounds.
Was asked basic ds questions
1) involved normal maths logic
2) involved normal sorting then later use heap to improve complexity
Later was asked to implement max heap from scratch
(3 Questions)
- Q1. Implement merge sort from scratch for sorting array of objects based on given key
- Ans.
Implement merge sort algorithm to sort array of strings based on a given key
Divide the array into two halves recursively
Merge the two sorted halves based on the given key
Repeat until the entire array is sorted
Example: ['apple', 'banana', 'cherry'] sorted based on length: ['apple', 'cherry', 'banana']
- Q2. Problem based on binary search
- Ans.
Binary search is an efficient algorithm for finding an item from a sorted list of items.
Binary search works on sorted arrays. Example: [1, 2, 3, 4, 5].
It divides the search interval in half. If the target is less than the middle element, search the left half.
Time complexity is O(log n), making it faster than linear search (O(n)).
Example: To find 3 in [1, 2, 3, 4, 5], check middle (3) and return index 2.
- Q3. Sql queries were asked It was nested query
(1 Question)
- Q1. Normal questions around why cardekho , tech stack , situation based questions etc
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
1 Question
- Q1. Questions related to Data Structures like Array, Stack, Queue.. etc., Questions related to Algorithms Like Dynamic Programming and Questions from DBMS.
I appeared for an interview before May 2021.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
Find the k-th Node from the End of a Linked List
Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...
- Ans.
To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.
Iterate through the linked list to determine its size.
Calculate the position of the k-th node from the end based on the size of the list.
Traverse the list again to reach the k-th node from the end.
Return a pointer to the k-th node from the end.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
High level System Design
- Q1. Can you design a system like Uber, explaining the various components and architecture involved?
- Ans.
Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.
User app for booking rides and tracking
Driver app for accepting rides and navigation
Server for handling requests and communication between apps
Database for storing user, driver, and ride information
Algorithms for matching riders with drivers and routing
Round duration - 45 minutes
Round difficulty - Easy
Basic HR questions
Interview Preparation Tips
Tip 1 : Practise DSA/coding consistently
Tip 2 : Choose a tech stack and Make side hobby projects
Tip 3 : Give mock interviews for your preparation evaluation
Tip 1 : Pointers about your current job responsibility
Tip 2 : Side Projects with Tech stack
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Interview Questionnaire
4 Questions
- Q1. Given a 2d matrix with some D doors and W walls, we need fill distance matrix with minimum distance to the nearest door
- Ans.
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
- Q2. Given a read-only array we want to find kth smallest element in unordered array with O(1) space
- Ans.
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
- Q3. Design question
- Q4. Find friends of friend who already are not friends with you
- Ans.
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
Interview Preparation Tips
Experience: 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.
Tips: Just walk the interviewer through the solution you're proposing.
Round: Other Interview
Experience: He started with a design question with how to stream an image such that all clients see the same image at the same time. You need to take care of delays, network problems. He kept on adding new elements like compression, streaming, utc time related issues, client rendering delays and so on.
Round: Other Interview
Experience: This was bar-raiser round.
Skills: Design, Algorithms And Data Structures, Graph Theory
College Name: IIT Madras
Skills evaluated in this interview
I appeared for an interview before Apr 2021.
(2 Questions)
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.
- Q1.
Kth Largest Element Problem Statement
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Example:
Input:
Array: [2,1,5,6,3,8], K ... - Ans.
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
- Q2.
Orange Rotting Problem Statement
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
- Value 0: Represents an empty cell.
- Value 1: Represents a fresh orang...
- Ans.
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.
Interview Preparation Tips
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.
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Dec 2015. There were 5 interview rounds.
Interview Questionnaire
6 Questions
- Q1. Reverse a linked list
- Ans.
Reverse a linked list
Iteratively swap the next and previous pointers of each node
Use three pointers to keep track of the current, previous, and next nodes
Update the head pointer to the last node after reversing
- Q2. Object Oriented Programming
- Q3. Database questions
- Q4. What do you like about this company
- Ans.
I appreciate the company's commitment to innovation and employee development.
Strong focus on innovation in software development
Opportunities for professional growth and development
Positive company culture and work environment
- Q5. Why do you want to work here
- Ans.
I am impressed by the company's innovative projects and collaborative work environment.
Impressed by innovative projects
Desire to work in a collaborative environment
Excited about potential for growth and learning opportunities
- Q6. Long term goals
Interview Preparation Tips
Experience: Simple aptitude test where they filtered out 2/3 of the applicants (12-15 selected out of 30)
Duration: 1 hour
Total Questions: 40
Round: Technical Interview
Experience: General questions about you, your projects etc.
The linked list question, you can write in any language you like.
OOP concepts like how it is implemented in your favourite language.
Round: Technical Interview
Experience: Your thoughts on designing a database for a company that aggregates jobs from any available source.
The schema for the database and your reason for it.
Round: HR Interview
Experience: Standard HR questions
College Name: Shiv Nadar University, Dadri
Skills evaluated in this interview
I appeared for an interview in Sep 2016.
Interview Questionnaire
9 Questions
- Q1. Questions on DBMS like find the 2nd maximum salary of employee
- Q2. A table was given and i need Normalize it
- Ans.
Normalization organizes data to reduce redundancy and improve integrity in databases.
Identify functional dependencies: Determine which attributes depend on others.
First Normal Form (1NF): Ensure all entries in a column are atomic. E.g., split 'Phone Numbers' into separate entries.
Second Normal Form (2NF): Remove partial dependencies. E.g., if 'StudentID' determines 'StudentName', separate into a new table.
Third Normal ...
- Q3. join, groupby queries on a given table
- Ans.
Understanding join and groupby queries is essential for data manipulation in SQL databases.
JOIN combines rows from two or more tables based on a related column. Example: SELECT * FROM A JOIN B ON A.id = B.a_id;
INNER JOIN returns records with matching values in both tables. Example: SELECT * FROM A INNER JOIN B ON A.id = B.a_id;
LEFT JOIN returns all records from the left table and matched records from the right table. E...
- Q4. Question related to Computer Networks like how internet works
- Q5. What is web server and application server
- Ans.
Web server handles HTTP requests and responses, while application server executes application logic.
Web server serves static content like HTML, CSS, JS files
Application server executes dynamic code like Java, Python, Ruby
Web server communicates with client, application server communicates with database
Examples of web servers: Apache, Nginx, IIS
Examples of application servers: Tomcat, JBoss, WebSphere
- Q6. Coding question to print a given pattern
- Ans.
This question involves coding a pattern based on specified rules, typically using loops and conditionals.
Identify the pattern structure (e.g., stars, numbers).
Use nested loops for rows and columns.
Example: For n=3, output could be: * ** ***
Consider edge cases like n=0 or negative values.
- Q7. Proper discussion on my projects that were mentioned in the resume. They usually ask to make class diagram, ER diagram of project etc.
- Q8. Firstly HR asked to introduce yourself
- Q9. Then he asked simple questions like why u want to join this company, my family background, asked about hobbies, academic achievements etc
Interview Preparation Tips
Experience: Two coding questions were given in the 1st round
1)find nodes at kth distance from root node
2)arrange a given array in min-max sequence
Duration: 1 hour
Total Questions: 2
College Name: Thapar University, Patiala
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Data Structures
- Q2. Algorithms knowledge
Interview Preparation Tips
I appeared for an interview before May 2021.
(1 Question)
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.
- Q1.
Boolean Matrix Transformation Challenge
Given a 2-dimensional boolean matrix
matof 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... - Ans.
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.
Interview Preparation Tips
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
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. What about that project in own way
CarDekho Group Interview FAQs
Some of the top questions asked at the CarDekho Group Software Development Engineer II interview -
Tell us how to improve this page.
CarDekho Group Interviews By Designations
- CarDekho Group Software Engineer Interview Questions
- CarDekho Group Sales Executive Interview Questions
- CarDekho Group Dealer Success Manager Interview Questions
- CarDekho Group Assistant Manager Interview Questions
- CarDekho Group Business Analyst Interview Questions
- CarDekho Group Senior Retail Associate Interview Questions
- CarDekho Group Production Manager Interview Questions
- CarDekho Group Business Manager Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Senior Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Associate Software Developer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Development Engineer Interview Questions
- Java Software Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 1 interview experience
Difficulty level
Duration
Software Development Engineer II Interview Questions from Similar Companies
CarDekho Group Software Development Engineer II Reviews and Ratings
based on 1 review
Rating in categories
|
Business Manager
196
salaries
|  ₹2.4 L/yr - ₹5 L/yr |
|
Key Account Manager
181
salaries
| ₹2.5 L/yr - ₹9.2 L/yr |
|
Dealer Success Manager
101
salaries
| ₹3.1 L/yr - ₹6.5 L/yr |
|
Assistant Manager
100
salaries
| ₹3.5 L/yr - ₹12.5 L/yr |
|
Senior Executive
98
salaries
| ₹2.5 L/yr - ₹7 L/yr |
Indiamart Intermesh
Udaan
BigBasket
Swiggy
- Home >
- Interviews >
- CarDekho Group Interview Questions >
- CarDekho Group Software Development Engineer II Interview Questions
