Heap: kth largest element in a stream
Problem Statement: You are given an infinite stream of integers, you need to find the kth largest element at any point of time. Example Input:…
Heap: Sum of all the elements between k1 and k2 smallest elements
Problem Statement: You are given array of integers and 2 numbers k1 and k2. You need to find the sum of all the elements between the given 2…
Heap: Connect ropes with minimum cost
Problem Statement: You are given n ropes of different lengths. You need to connect the ropes into one rope. The cost to connect 2 ropes is…
Heap: Top K Frequent Words
Problem Statement: You are given an array of repeated numbers and a integer K. You need to find the top K numbers that are repeated maximum…
Heap: Frequency sort
Problem Statement: You are given an array with repeated elements. You need to sort such that the one that has ore frequency should come first.…
Heap: Top K Frequent Elements
Problem Statement: You are given an integer array and a value k, you need to return the k most frequest elements. Example Input: nums =…
Heap: K closest number
Problem Statement: You are given an array and a value k and x. You need to find the k closest elements to x in arr[] Example arr[] = { 5, 6,…
Heap: Sort a K sorted array or nearly sorted array
Problem Statement: You are given an array elements in which each element is at k away from its target position. Example Input: arr[] = {6, 5,…
Heap: Return k largest element
Problem Statement: You are given an unsorted array of integer elements and “k”. You need to get the “k” largest…
Heap: Kth smallest element.
Problem Statement: You are given an unsorted array of integer elements and “k”. You need to get the “k”th smallest…
