## MakeMyTrip Interview Experience | Set 8 (On-Campus)

MakeMyTrip recently visited our campus. There were 4 rounds. Online Round ( 1 Hour ) This round consisted of 20 aptitude questions and 3 coding… Read More »

## Construct all possible BSTs for keys 1 to N

In this article, first count of possible BST (Binary Search Trees)s is discussed, then construction of all possible BSTs. How many structurally unique BSTs for… Read More »

## K’th smallest element in BST using O(1) Extra Space

Given a Binary Search Tree (BST) and a positive integer k, find the k’th smallest element in the Binary Search Tree. For example, in the… Read More »

## Count BST subtrees that lie in given range

Given a Binary Search Tree (BST) of integer values and a range [low, high], return count of nodes where all the nodes under that node… Read More »

## OLA Interview Experience | Set 6 (For SDE-1)

Last month i was interviewed by Ola for SDE 1 post. Here is my experience. Round 1 a. Inorder predecessor and successor for a given… Read More »

## Count BST nodes that lie in a given range

Given a Binary Search Tree (BST) and a range, count number of nodes that lie in the given range. Examples: Input: 10 / \ 5… Read More »

## K’th largest element in a stream

Given an infinite stream of integers, find the k’th largest element at any point of time. Example: Input: stream[] = {10, 20, 11, 70, 50,… Read More »

## Second largest element in BST

Given a Binary Search Tree(BST), find the second largest element. Examples: Input: Root of below BST 10 / 5 Output: 5 Input: Root of below… Read More »

## MAQ Software Interview Experience | Set 7

Round 1: written Apti, C, C++, OS, DS Round 2: coding 2 questions, 30 mins 1. Serialize and deserialize a given n-ary tree.      Ans: solved… Read More »

## Data Structure for a single resource reservations

Design a data structure to do reservations of future jobs on a single machine under following constraints. 1) Every job requires exactly k time units… Read More »

## How to handle duplicates in Binary Search Tree?

In a Binary Search Tree (BST), all keys in left subtree of a key must be smaller and all keys in right subtree must be… Read More »

## VMWare Interview Experience | Set 3

I had interview with VMWare. Their process is 1 written test followed by 1 telephonic and 3/4 f2f interviews. Writtent test Very basic questions. They… Read More »

## BankBazaar Interview Experience | Set 2

I had an interview with BankBazaar.com. Their process is online coding test followed by a telephonic and f2f interviews. Written test The person who wrote… Read More »

## Advantages of BST over Hash Table

Hash Table supports following operations in Θ(1) time. 1) Search 2) Insert 3) Delete The time complexity of above operations in a self-balancing Binary Search… Read More »

## Accolite Interview Experience | Set 3 (On-Campus)

Written MCQ There were 20 multiple choice questions to be done in 30 minutes time and most of the technical questions were from geeksquiz ,… Read More »