Consider a Binary Heap of size N. We need to find the height of it. Examples: Input : N = 6 Output : 2 ()… Read More
Category Archives: Heap
Given an array of elements, sort the array in decreasing order using min heap. Examples: Input : arr[] = {5, 3, 10, 1} Output :… Read More
Given an array of n integers and a number m, find the maximum possible difference between two sets of m elements chosen from given array.… Read More
In previous post i.e. Set 1 we have discussed that implements these below functions: insert(H, k): Inserts a key ‘k’ to Binomial Heap ‘H’. This… Read More
Given two equally sized arrays (A, B) and N (size of both arrays). A sum combination is made by adding one element from array A and… Read More
Given an n x n matrix and integer k. Find the k’th smallest element in the given 2D array. Examples: Input : mat = [[10,… Read More
We have discussed one loss minimization strategy before: Job Sequencing Problem – Loss Minimization. In this article, we will look at another strategy that applies… Read More
Given n, how many distinct Max Heap can be made from n distinct integers? Examples: Input : n = 3 Output : Assume the integers… Read More
Given an array arr[] containing n elements. The problem is to find the maximum number of distinct elements (non-repeating) after removing k elements from the… Read More
Round 1: Place all numeric characters in string before alphabet characters . Using min swaps and O(1) space and Maintain the order of characters. Round… Read More
Given an n x n matrix, where every row and column is sorted in non-decreasing order. Print all elements of matrix in sorted order. Examples:… Read More
Given the sequence find the lexicographically smallest (earliest in dictionary order) derangement of A derangement of S is any permutation of S such that no two… Read More
Given two sorted arrays, the task is to merge them in a sorted manner. Examples: Input : arr1 = [1, 3, 4, 5] arr2 =… Read More
