OLA Cabs interview questions
Online test → Technical → Technical·55% entry level
DSA
Showing 31 of 97 reported in this area
Print the left view of a binary tree.
Find the missing number in an arithmetic progression.
Implement the Minesweeper game logic.
Count the number of inversions in an array.
Find the next permutation of a given string
Generate all permutations of a given string.
Implement an LRU (Least Recently Used) cache.
Find the median from a running stream of numbers.
Merge K sorted arrays into a single sorted array.
Perform spiral (zigzag) traversal of a binary tree.
Write full code to create a mirror of a binary tree
Find the number of islands in a given binary matrix.
Implement LRU cache using a language of your choice.
Check whether a given binary tree is a Binary Search Tree (BST).
Given a binary tree, print all the nodes visible from the top view.
Given a node in a binary tree, find and print its inorder successor.
Boolean Matrix problem (modify the matrix based on boolean conditions).
Given a matrix, if an element is 0, set its entire row and column to 0.
Given a very large matrix, find the maximum connected region available.
Print all nodes at a given distance K from a target node in a binary tree.
How would you sort a very large file on a single machine with limited memory?
Given a string, count the number of different substrings that are palindromes.
Find the square root of a number without using inbuilt functions in O(log N) time.
Implement string matching where the pattern string may contain wildcard characters.
Given x, y, and k, find the maximum value of a XOR b equal to k such that x ≤ a < b ≤ y.
Find the inorder predecessor and successor for a given key in a Binary Search Tree (BST).
Generate all distinct permutations of a given string that may contain duplicate characters.
Given a number, generate the next smallest permutation greater than the current permutation.
Given one small file and one very large file, how would you find all numbers common to both?
Design and implement an LRU Cache using Doubly Linked List and HashMap with given constraints
Represent the fraction of two integers as a string, handling repeating decimals appropriately.
CS fundamentals
Showing 15 of 49 reported in this area
Explain how decision trees work.
Explain Support Vector Machines (SVM).
How does Garbage Collection work in Android?
How would you optimize a slow-running SQL query?
Explain the internal working of HashMap and hashing
Explain heap implementation and its time complexities
What are different approaches to unsupervised learning?
How can the UI of Fragment B be updated from Fragment A?
How would you mock Couchbase while writing unit test cases?
How would you handle concurrency in the logging library design?
What are schedulers and how are they used in large-scale systems?
Explain common design patterns and related architectural concepts.
Describe the CI/CD pipeline and its importance in software development.
How would you handle uncertainties in Linear Discriminant Analysis (LDA)?
How does a hash table work? Describe its best-case and worst-case time complexity.
System design
Showing 11 of 27 reported in this area
Design an LRU (Least Recently Used) cache.
Design a MapReduce job to sort a very large dataset.
Explain the Circuit Breaker pattern and its use cases
How would you handle tail queries in a large-scale system?
Explain different load balancing strategies and when to use them
Design an email system with tagging and sub-tagging functionality.
Design and implement a Bowling Game with proper object-oriented design
Given an input stream of bits, check the occurrence of a given binary sequence.
Discuss scalability considerations for different types of databases and caching layers
Design a search-based replacement for the existing Support tab navigation in the OLA app
Design an application monitoring system to handle data coming from various applications.
Puzzles
2 questions reported in this area
Given two customers and two restaurants with preparation times and distances, determine the optimal delivery trajectory to minimize total delivery time.
Puzzle: An employer has a gold bar of 7 units and must give 1 unit per day for 7 days. Using a magical knife that can only make two cuts total, how should the bar be cut?
Behavioural
1 questions reported in this area
How would you quickly start executing in a new technical area under time constraints?
asked oncePractice this →
Showing 60 of 160 questions. Ranked by how often the same question came back across reports.
Practise a OLA Cabs-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does OLA Cabs ask?
Candidate interview reports most often cover DSA (55%) and CS fundamentals (28%).
How many rounds does OLA Cabs interview have?
Candidate interview reports show an average of 3.4 rounds per experience, with a typical sequence of Online test → Technical → Technical. Individual interview paths can vary.
Is the OLA Cabs interview hard?
Among questions with a reported difficulty, the mix is easy 31%, medium 53%, hard 16%.