## Find number of cavities in a matrix

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 »

## Ola Interview Experience

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 »

## OLA Interview Experience (Off-Campus)

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 »

## 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 »

## 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 »

## Shortest distance between two nodes in BST

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 »

## 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. Slight change… 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 sub string in a given string. Length of palindrome sub string is greater than or… 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 »