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

- Largest Sum Contiguous Subarray
- Level Order Tree Traversal
- Stock Buy Sell to Maximize Profit
- Find the number of islands | Set 1 (Using DFS)
- Sort an array of 0s, 1s and 2s
- Find the Missing Number
- Print Left View of a Binary Tree
- Median in a stream of integers (running integers)
- Maximum difference between two elements such that larger element appears after the smaller number
- Level order traversal in spiral form
- Given a string, find its first non-repeating character
- Sudoku | Backtracking-7
- Convert a Binary Tree into its Mirror Tree
- Print all nodes at distance k from a given node
- Connect nodes at same level
- Find the element that appears once
- Median of Stream of Running Integers using STL
- Wildcard Pattern Matching
- Clone a linked list with next and random pointer | Set 1
- Search in a row wise and column wise sorted matrix
- Count All Palindrome Sub-Strings in a String | Set 1
- Square root of an integer
- Puzzle 4 | (Pay an employee using a 7 units gold rod?)
- Connect nodes at same level using constant extra space
- A Boolean Matrix Question
- Find all distinct palindromic sub-strings of a given string
- Connect Nodes at same Level (Level Order Traversal)
- Inorder predecessor and successor for a given key in BST
- Print nodes at k distance from root
- Find the element that appears once in a sorted array

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 »

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 »

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

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 »

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 »

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 »

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 »