Ola Cabs Interview Questions, Process, and Tips

Q1. What are your family background
Ans. 
In my family there is mother and father and one big brother and three big sisters. and my wife and my daughter
Answered Anonymously
View 6 more answers
Q2. Last per work location and position
Ans. 
my last job shift manager in ola grocery store
Answered Anonymously
Add your answer
Q3. And store general knowledge questions
Add your answer

Q1. Introduction , and normal discuss , perviuos job exprence
Add your answer
Q2. Knowladge of marketing works for other company and all
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was a problem solving round where a hackerrank link was given containing 2 questions.
You have to solve them within 90 minutes.
I was asked to solve it within a week.

Q1. 
Find Distinct Palindromic Substrings
Given a string 'S', identify and print all distinct palindromic substrings within it. A palindrome reads the same forwards and backwards. For example, 'bccb' is a pali...read more
Ans. 
Step 1 : Find all the palindromic sub-strings
Step 2 : Remove duplicate palindromes
Step 3 : Print the distinct palindromes and number of such palindromes
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

2 questions was asked by the interviewer. You have to clearly explain your approach and write a working solution. He even asked me to run on some additional test cases

Q1. 
Job Sequencing Problem Statement
You are provided with a N x 2 2-D array called Jobs consisting of N jobs. In this array, Jobs[i][0] represents the deadline of the i-th job, while Jobs[i][1] indicates the...read more
Ans. 
Sort the jobs based on their deadlines.
Iterate from the end and calculate the available slots between every two consecutive deadlines. Include the profit, deadline, and job ID of ith job in the max heap.
While the slots are available and there are jobs left in the max heap, include the job ID with maximum profit and deadline in the result.
Sort the result array based on their deadlines.
Answered Anonymously
Add your answer
Q2. 
Partition Equal Subset Sum Problem
Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...read more
Ans. 
Let isSubsetSum(arr, n, sum/2) be the function that returns true if 
there is a subset of arr[0..n-1] with sum equal to sum/2

The isSubsetSum problem can be divided into two subproblems
a) isSubsetSum() without considering last element 
(reducing n to n-1)
b) isSubsetSum considering the last element 
(reducing sum/2 by arr[n-1] and n to n-1)
If any of the above subproblems return true, then return true. 
is...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

I was asked 1 system design question. The question was to design an online multiplayer game which can be scaled for more than 10 million users. 
The interviewer helped me to collect requirement and also helped me in choosing different low latency protocol to communicate between client and server.

Round duration - 60 minutes
Round difficulty - Medium

The interviewer asked few sql based questions and asked me to write the solution.
He also gave 1 problem solving question.

Q1. Can you explain the different types of joins in SQL and how to calculate the average of all values from a given table?
Add your answer

Q1. About used cars sales
Add your answer

Q1. Salary discussion and
Add your answer

Q1. What are the two factors that differentiate you from the other trainers.
Add your answer
Q2. What do you bring to the table which you are absolutly confident about and you can nail it here in the new field?
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was coding round and was conducted on Google meet with code link shared. Their were 2 interviewers that gave questions and later ran code on sample test cases.

Q1. 
Problem: Permutations of a String
Given a string STR consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.
Explanatio...read more
Ans. Backtracking
The idea is to fix a character at a position and then find the permutations for rest of the characters.
Make a list ‘ans’ which will contain the permutations of the given string.
 
Algorithm:
Let’s define a function generatePermutaionsHelper(Str, l, r). This function generates the permutations of the substring which starts from index  ‘l’ and ends at index  ‘r’.
• Call the function: generatePermutai...read more
Answered Anonymously
Add your answer
Q2. 
Find the Kth Row of Pascal's Triangle Problem Statement
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
Example:
Input:
K = 2
Output:
1 1
Input:
K = 4
Output:
1 4 6 ...read more
Ans. Naive Approach
In this approach, we find the row elements of the previous row using recursion, and based on the values of previous row elements, we will evaluate the current row elements.
1. We are given a function kthRow() which takes an integer ‘K’ as the only parameter and returns an integer vector. This is the definition of our recursive function too.
2. As the base condition of our recursive function, we will check if ‘K’ ...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was a Machine Coding Round/LLD round followed by HLD round which was taken by Video Conferencing and Screen Sharing.

Round duration - 60 minutes
Round difficulty - Easy

This was the last round. This was HM round followed by the HR round.