Ola Cabs Software Developer Intern Interview Questions and Answers

More focus on dp,graphs.

Q1. Focus on backend concepts,routing.
Add your answer
Q2. Question on flood fill algo,backtracking.
Add your answer

Round duration - 65 minutes
Round difficulty - Hard

Timing (6pm - 8pm)
Environment was user friendly
As usual the online round had three coding questions and 20 MCQs. This was a pretty easy round and it’s duration was 65 minutes. The round consisted of questions from various domains like Algorithm, Data Structure, Operating System and Aptitude.

Q1. 
Determine Count of Good Triplets
You are given two arrays ARR1 and ARR2, containing N and M elements respectively. There are two types of 'good triplets' that need to be identified in these arrays.
Type ...read more
Add your answer
Q2. 
Split the String Problem Statement
You are given a string str consisting of N lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Q1. 
Check if Two Trees are Mirror
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Explanation:
Two trees are considered mirror of each other if...read more
Add your answer
Q2. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Add your answer

Q1. Valid BT or not
Add your answer
Q2. Make complete row and column zero in a matrix for each element that is already 0
Ans. 
Use a two-pass approach to mark rows and columns with zeros based on existing zeros in the matrix.
• Iterate through the matrix to mark rows and columns with zeros based on existing zeros

• Use two arrays to keep track of which rows and columns need to be zeroed out

• Perform a second pass to update the matrix based on the marked rows and columns
Answered by AI
Add your answer

Similar to Round 1 but more hard questions

Round duration - 75 minutes
Round difficulty - Easy

Timing it is around 11 am and Environment is good .

Q1. 
Bird and Maximum Fruit-Gathering Problem Statement
A ninja bird can gather fruits from trees arranged in a circle. Each tree has an associated fruit value. The bird can gather all the fruits from a tree i...read more
Add your answer
Q2. 
Base 58 Conversion Problem Statement
You are given a decimal number 'N'. Your task is to convert this number into a base 58 representation.
The Base58 alphabet is defined by the following characters: “12...read more
Add your answer

Round duration - 45 mintues
Round difficulty - Medium

Environment was very friendly but questions asked are hard

Q1. 
Pair Sum Problem Statement
You are provided with an array ARR consisting of N distinct integers in ascending order and an integer TARGET. Your objective is to count all the distinct pairs in ARR whose sum...read more
Add your answer
Q2. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Add your answer