Ola Cabs Interview Questions, Process, and Tips

Q1. More or less the questions were on the role applied
Add your answer

Q1. More or less the questions were on the resume and role applied
Add your answer

Q1. Interview with a senior authority on the role applied and past projects
Add your answer

Round duration - 1 hour
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. 
Print Permutations - String Problem Statement
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
Input:
The first and only line of input ...read more
Ans. Backtracking
We can find all the permutations by Backtracking.
 
1: Fix a character then swap all the rest of the remaining character with a fixed character.
2: Then find all permutations for all remaining characters by the recursive call.
3: The base case for the recursion will be when there is only one character left unprocessed.
 
Below is the illustration to approach.
 
Space Complexity: O(n)Explanation:
O(N)...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 - 2 hours
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 - 75 minutes
Round difficulty - Medium

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

Q1. Traverse singly linked list in forward as well as in backward directions
Ans. 
To traverse a singly linked list in both forward and backward directions, we can use a doubly linked list.
• Create a doubly linked list with next and previous pointers

• Start traversing from the head node to the tail node using the next pointers

• To traverse in the backward direction, start from the tail node and use the previous pointers

• Continue traversing until reaching the end of the list
Answered by AI
View 1 more answer
Q2. Why you want to join ola?
Add your answer
Q3. Research about company and answer smartly
Add your answer