Coding Interview Questions

Problem Statement: You are given a data stream, you need to get the median of the elements after each integer is read. Median can be found by:…

Problem Statement: Given a BST that is a complete binary tree, you need to convert into Min Heap. What is a BST ? A binary tree that satisfies…

Problem Statement: You are given 2 max heaps. You need to merge them into a single max heap Example: Solution 1: Using Priority Queue Take a…

Problem Statement: Given an array and a value K, return the kth smallest element Example: Input: arr = [3, 6, 1, 2, 7, 8] k = 2 Output: 2…

In this chapter we will learn about priority queue. Priority Queue is a data structure, where each element is associated with a priority…

In this chapter we will learn about heap sort. To know the basic of Heap, checkout the previous chapters. Below are the steps followed for…

Heap is a complete binary tree and is a type of Data Structure. Heap satisfies a heap order property. A binary tree, is a complete binary tree…

Problem Statement: Given a number, count the number of set bits using recursion Example: Input: 21 Output: 3 Solution Explanation: We will use…

Problem Statement: You are given a number N, that will represents number of people at the party. You need to find the total number of…

Problem Statement: Given 2 numbers find the product of the numbers, using recursion Example: Input: m = 10 n = 2 Output: 20 Solution…