Ola Cabs Interview Questions (2026)
10 questions · 1 experiences · GeeksforGeeks (11)
Browse by role
11 entries
OLA Interview Experience | Set 11 ( For Internship)
OLA Interview Experience | Set 10 ( For DS)
OLA Cabs Interview Experience | Set 2 (For Android - 1.5 Years)
OLA Cabs Interview Experience (Bangalore)
Ola Cabs Interview Experience for SDE-2
OLA Interview Experience | For Experienced -SDE-2
OLA Interview Experience | Set 12
Ola Interview Experience for Developer role
Ola Interview Experience (1 Year Experienced)
Ola Interview Experience | Set 14 (For SDE 1)
OLA Electric Interview Experience for SDE (On-Campus)
OLA Interview Experience | Set 11 ( For Internship)
Question Details
Round 1 (Online Test): Four Programming Questions- a) Given a string find number of different substrings that are palindromes. b) In a matrix we can destruct it's one column by vanishing any of the element in column . We have to destruct the matrix completely so that sum of the elements destucted by us (not that destructed itself) is minimum, given the constraint that atleast one of the elements in a row should be canceled by us.
Output is that minimum sum. c) Given N points in a grid we have to find all different(altlest one uncommon side) squares of side length K. N, K and points will be input and number of different squares will be output. d) Given an array we have to sort that in inceasing order such that value of V is minimum. where V = sum(position of element in given array * position of element sorted array), position of element is 1 based.
Output is sorted array and V. Round 2 (Interview Round 1): Concepts of OOPs like Polymorphism and Inheritance and questions related to projects done. Round 3 (Interview Round 2): 1. Some more OOPs concepts. 2. Data Structures like Hashmap, Sorting algos ( Quick sort and Merge sort ) (complextiy and just how to implement them). 3. What is Java (as it was my primary programming language). 4. Difference between static and dynamic programming languages. 5. Implementation of Linked List (Code with proper syntax). 6. How to find Square root of a number (without using inbuilt functions, best efficient way O(logN)). 7. In a array each number is stored twice except one that is placed only once. (Best efficient O(logN)). 8. In a sorted array having elements from 1 to N, only one is missing and so array size is N-1. Find missing number in best efficient way (O(logN)) and without possibility of overflow. Related Practice Problems Count Palindrome Sub-Strings of a String Find the element that appears once in sorted array Alone in couple Count Squares Distinct palindromic substrings Missing number in array All Practice Problems for Ola-Cabs !
Topics
More from Ola Cabs
Related companies
Ola Cabs Interview Process Overview
The Ola Cabs interview process typically includes a recruiter screen, one to two technical phone screens, and a 4-6 round on-site or virtual on-site loop. Each round serves a distinct calibration purpose: coding rounds measure correctness, code quality, and complexity reasoning; system design rounds measure architectural judgment at the appropriate level; behavioral rounds measure ownership, leadership scope, and collaboration. Reports tagged on LeakCode from 2024-2026 show Ola Cabs runs a calibrated process consistent with industry norms for companies of its tier.
Difficulty calibration: Ola Cabs coding rounds typically run medium difficulty with follow-up depth as the senior discriminator. System design rounds expect production-grade trade-off articulation at L4+ levels. Behavioral rounds expect quantified outcomes ("reduced p99 latency from 800ms to 120ms") rather than vague impact claims. The candidates who advance consistently demonstrate clear thinking out loud rather than perfect final answers.
How To Use Ola Cabs Question Reports
Real candidate-reported interview questions are a calibration tool, not a memorization target. Ola Cabs updates its question pool every 2-4 months; memorizing exact problems risks misleading you when the interviewer uses a variant. The high-leverage approach: identify the patterns that appear repeatedly in Ola Cabs reports, practice those patterns on similar (not identical) problems, and use the reports to understand the interviewer's typical follow-up depth.
Filter the questions above by round type, difficulty, and recency. Focus first on reports from the past 6-12 months; older reports may reference questions that have since rotated out of Ola Cabs's pool. Reports tagged with quantified difficulty and explicit round type are higher-signal than reports without those tags. The metadata filters help you build a focused study plan in 1-2 hours rather than 8-10 hours of unstructured browsing.
Common Ola Cabs Interview Mistakes
Reports tagged "no hire" at Ola Cabs consistently surface a few patterns: jumping into code without clarifying requirements, coding silently for extended periods, missing edge cases (empty input, single element, large input, overflow), producing working code the candidate cannot refactor when probed, and behavioral stories that use "we" instead of "I" diluting individual signal. Strong candidates explicitly avoid these patterns by following a consistent round template.
The single most predictive failure mode in recent reports: not asking clarifying questions. Interviewers are explicitly trained to weight this dimension. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into implementation immediately. Strong candidates also verbalize their approach before writing code; weak candidates code in silence and lose the communication dimension of the round's calibration.