Hashing: Longest consecutive sequence
Problem Statement: You are given an array, you need to find the length of the longest sub sequence Example: Input: [2, 1, 3, 4, 9, 5, 6]…
Hashing: You are given an array, you need to return kth distinct element
Problem Statement: You are given an array with duplicate elements and a k integer. You need to find the k’th non repeating integer in…
Heap: Given an array, find the kth smallest pair sum
Problem Statement: You are given an array and an integer k, you need to find the kth smallest pair sum Example: Input arr = [1, 2, 4, 3] k = 2…
Heap: Given an array, find the top K frequency elements
Problem Statement: Given an array, find the top K frequency elements Solution Explanation: We will use frequency array and then use min heap…
Heap: Given an array, find the kth largest element in the array
Problem Statement: You are given an array and a value k. Then yoou need to return the k th largest elements. Example: Input: arr = [1, 2, 3,…
Heap: Find the minimum product of k integers in an array
Problem Statement: Given an array and a value k, you need to find the minimum product of k integers Example: Input: arr [] = [1, 5, 3, 2, 6] k…
Heap: K Closest Points To Origin
Problem Statement: You are given a 2D array and a value k. You need to return the k closest to the origin (0,0). Example: Input: points =…
Heap: Given level order traversal of Binary Tree, check if the tree is Min Heap
Problem Statement: You are given level order of the Complete Binary Tree. Check if the Binary Tree is a valid Min Heap Example: Input: arr[] =…
Heap: kth largest in a stream
Problem Statement: You are given an infinite stream of number and a number k. You need to return the kth largest element after every insert.…
Heap: Given an array, check if the array represents Binary Max Heap
Problem Statement: You are given an array, you need to check if the array represents Binary Max Heap Example: Input: arr = {7, 3, 6, 1, 2, 4,…