As per my personal experience. Before we think about the interview process, we need to be confident in what we know. We need to have… Read More
Tag Archives: Ola Cabs
It was a weekend drive. They asked me to bring my own laptop. Round 1: Coding Round (90 mins) via Hacker Rank Q1) Given a… Read More
Count the number of the cavity in the 2d matrix, a cavity is defined as all the surrounding number are greater than the mid number.… Read More
I was part of a recruitment drive in Ola’s headquarters in Bangalore. The first row was a Hackerrank test which consisted of a DS question,… Read More
I applied to OLA in off campus drive for Full Stack Developer role. 1. First round was telephonic round. First question was tell me about… Read More
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
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
Given a Binary Search Tree and two keys in it. Find the distance between two nodes with given two keys. It may be assumed that… Read More
Round 1:- Hacker Rank [online test] Question 1 :- count the path in the 2d Matrix, only right and down move is allowed. Slight change… Read More
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
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
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
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
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