CarDekho Group Regional Head Interview Questions and Answers

Salary cycle refers to the frequency at which employees are paid, such as weekly, bi-weekly, or monthly.

• Salary cycle can vary depending on the company's policies and practices.

• Common salary cycles include weekly, bi-weekly (every two weeks), semi-monthly (twice a month), and monthly.

• Some companies may also offer different salary cycles for different employee groups, such as hourly vs. salaried employees.

• Understanding t...read more

I am looking to establish a long-term career with the company and grow professionally.

• I am committed to contributing to the company's success for the foreseeable future

• I am eager to take on new challenges and responsibilities within the organization

• I value stability and growth opportunities in my career

Quantifiable factors to rate cab drivers for company's purpose

• Customer ratings and feedback

• Number of completed trips

• Average trip duration

• Percentage of on-time pickups

• Accident and traffic violation history

• Vehicle cleanliness and maintenance

• Driver punctuality and professionalism

The criterion for choosing between Yuvraj Singh and Stuart Binny for the World Cup squad would be based on their recent performance, fitness, and team balance.

• Evaluate recent performance of both players

• Assess fitness levels of both players

• Consider team balance and required skill sets

• Analyze pitch and weather conditions of the tournament

• Take into account the opposition teams and their strengths and weaknesses

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