## Binomial Heap

The main application of Binary Heap is as implement priority queue. Binomial Heap is an extension of Binary Heap that provides faster union or merge… Read More »

- Introduction to Data Structures | 10 most commonly used Data Structures
- Find the smallest positive number missing from an unsorted array : Hashing Implementation
- Rearrange numbers in an array such that no two adjacent numbers are same
- Merge two sorted arrays in constant space using Min Heap
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Maximum possible sub-array sum after at most X swaps
- Reduce the array to a single integer with the given operation
- Maximise the number of toys that can be purchased with amount K using min Heap
- Pairing Heap
- Implementation of Non-Preemptive Shortest Job First using Priority Queue

The main application of Binary Heap is as implement priority queue. Binomial Heap is an extension of Binary Heap that provides faster union or merge… Read More »

A Binary Heap is a Binary Tree with following properties. 1) It’s a complete tree (All levels are completely filled except possibly the last level… 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. Example:… Read More »

There are given n ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal… Read More »

Given an n x n matrix, where every row and column is sorted in non-decreasing order. Find the kth smallest element in the given 2D… Read More »

VMWare interview for MTS-2 position. I Telephonic round 1. Given an array of strings. Find the maximum prefix among all the strings. Ans: First told… Read More »

Given k sorted arrays of size n each, merge them and print the sorted output. Example: Input: k = 3, n = 4 arr[][] =… Read More »

First of all, a very very big thanks to whole team of geeks for geeks. It is because of them only that I was able… Read More »

Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the… Read More »

Why array based representation for Binary Heap? Since a Binary Heap is a Complete Binary Tree, it can be easily represented as array and array… Read More »

Design a Data Structure for the following operations. The data structure should be efficient enough to accommodate the operations according to their frequency. 1) findMin()… Read More »

Given N machines. Each machine contains some numbers in sorted form. But the amount of numbers, each machine has is not fixed. Output the numbers… Read More »