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…
Stacks: Validate stack operations
Problem Statement: You are given 2 sequence of operations, push and pop. You need to return true if it is result of a sequence of push and pop…
Score of Parentheses
Problem Statement: You are given a string consisting of pair of balanced parentheses. You need to calculate the total score of the given…
Stacks: Check if the given pattern exist in the array
Problem Statement: You are given an array, you need to find 3 integers, such that i < j < k and nums[i] < nums[k] < nums[j]…