## Heap Sort for decreasing order using min 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 »

- Find k closest numbers in an unsorted array
- Building Heap from Array
- Insertion and Deletion in Heaps
- Find m-th smallest value in k sorted arrays
- Find the smallest positive number missing from an unsorted array : Hashing Implementation
- Find the shortest distance between any pair of two different good nodes
- Rearrange numbers in an array such that no two adjacent numbers are same
- Uniform-Cost Search (Dijkstra for large Graphs)
- Minimize the sum calculated by repeatedly removing any two elements and inserting their sum to the Array
- TIAA Internship Experience - Pool campus for Internship
- Introduction to Data Structures | 10 most commonly used Data Structures
- Maximum possible sub-array sum after at most X swaps
- Reduce the array to a single integer with the given operation

Given an array of elements, sort the array in decreasing order using min heap. Examples: Input : arr[] = {5, 3, 10, 1} Output :… Read More »

HeapSort is a comparison based sorting technique where we first build Max Heap and then swaps the root element with last element (size times) and… 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… 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 maximum number of distinct elements (non-repeating) after removing k elements from the array.… 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 as any permutation of S such… 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 »

Given any sequence , find the largest derangement of . A derangement is any permutation of , such that no two elements at the same… Read More »

Binary Heap is a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left… Read More »