Ola Cabs Interview Questions, Process, and Tips

Round duration - 90 mintues
Round difficulty - Medium

Goes good no problem at all exam is between 10 to 11:30.

Q1. 
Game of Dominoes Problem Statement
Rafiq loves to play with piles of dominoes, especially when they are of equal heights. His father gifted him 'N' piles of dominoes, each with a positive number of stacke...read more
Ans. 
Calculate minimum cost to make consecutive windows of domino piles equal in height.
• Iterate through each window of size 'K' and calculate the minimum cost to make all piles in that window equal in height.

• Keep track of the running sum of domino heights in each window to minimize cost.

• Return the minimum cost for each window as the output.
Answered by AI
Add your answer
Q2. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
• Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

• If the complement exists, add the pair (current element, complement) to the result list.

• Sort the result list based on the first element of each pair, and then based on the second element if the first elements are eq
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Goes good no problem at all exam at same time between 10 to 11:30.

Q1. What problems did you face in your project and how did you deal with them?
Add your answer
Q2. 
Ninja and Sorted Arrays Problem
You are given two sorted integer arrays, ARR1 and ARR2, with sizes M and N, respectively. Merge these arrays into ARR1 as a single sorted array. Assume ARR1 has a size equa...read more
Ans. 
Merge two sorted arrays into one sorted array in place.
• Iterate from the end of both arrays and compare elements, placing the larger element at the end of ARR1

• Continue this process until all elements from ARR2 are merged into ARR1

• Ensure to handle cases where one array is fully merged before the other
Answered by AI
Add your answer