OLA Interview Experience | Set 15 (1 Year Experienced for SDE1)
I recently applied for OLA SDE 1 from Linkedin. HR got in contact with me via email and scheduled an interview date for F2F Round… Read More »
Tag Archives: Ola Cabs
Ola Interview Experience | Set 14 (For SDE 1)
Round 1: coding competition on Hackerrank It has 3 questions. Ticket booking system: ‘N’ people are standing queue to collect tickets. Due to high demand,… Read More »
Ola Interview Experience | Set 13 (For SDE 2)
Round 1:- Hacker Rank [online test] Question 1 :- count the path in the 2d Matrix, only right and down move is allowed. https://www.geeksforgeeks.org/count-possible-paths-top-left-bottom-right-nxm-matrix/ Slight… Read More »
Connect Nodes at same Level (Level Order Traversal)
Write a function to connect all the adjacent nodes at the same level in a binary tree. Example: Input Tree A / \ B C… Read More »
Median of Stream of Running Integers using STL
Given that integers are being read from a data stream. Find median of all the elements read so far starting from the first integer till… Read More »
Find the character in first string that is present at minimum index in second string
Given a string str and another string patt. Find the character in patt that is present at the minimum index in str. If no character… Read More »
OLA Interview Experience | Set 12
Round 1: Hackerearth online coding round. Round 2: (1 hrs 15 minutes) Left View of a binary tree Explain Binary search and it’s complexity. How… Read More »
OLA Interview Experience | Set 11 ( For Internship)
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… Read More »
Iterative program to count leaf nodes in a Binary Tree
Given a binary tree, count leaves in the tree without using recursion. A node is a leaf node if both left and right children of… Read More »
Count All Palindrome Sub-Strings in a String | Set 1
Given a string, the task is to count all palindrome substring in a given string. Length of palindrome substring is greater then or equal to… Read More »
OLA Interview Experience | Set 10 ( For DS)
1. Abut my DS related work. Why change? IsBST() Kadane algo with start and end indices. 2. What is SVM? Given a hard disk with… Read More »
OLA Interview Experience | Set 9 (For SDE-1)
1. Written Find unions of all intervals(startime, endtime) Design cricket score dashboard (which can give match result, tournament result and player stats) 2. how to… Read More »
Wildcard Pattern Matching
Given a text and a wildcard pattern, implement wildcard pattern matching algorithm that finds if wildcard pattern is matched with text. The matching should cover… Read More »
OLA Interview Experience | Set 8 (For SDE-2)
Design Round: 1. Design LRU cache and implement 2. Solving sudoko 3. Design to replace the existing Support tab navigation based to search based in… Read More »
Square root of an integer
Given an integer x, find square root of it. If x is not a perfect square, then return floor(√x). Examples : Input: x = 4… Read More »