# Category Archives: Heap

Given an array of integers, find the k largest number after deleting the given elements. In case of repeating elements, delete one instance for every… Read More
Prerequisites: Binomial Heap Binomial trees are multi-way trees typically stored in the left-child, right-sibling representation, and each node stores its degree. Binomial heaps are collection… Read More
In the last post, we discussed the Insertion and Union of Fibonacci Heaps. In this post, we will discuss Extract_min(), Decrease_key() and Deletion() operations on… Read More
Fibonacci Heap is a collection of trees with min-heap or max-heap property. In Fibonacci Heap, trees can have any shape even all trees can be… Read More
Given a min heap, find the maximum element present in the heap. Examples:  Input : 10 / \ 25 23 / \ / \ 45… Read More
Given a max heap, find the minimum element present in the heap. Examples:   Input : 100 / \ 75 50 / \ / \ 55… Read More
Given an array of n elements, where each element is at most k away from its target position, devise an algorithm that sorts in O(n… Read More
There are two parts of memory in which an object can be stored: stack – Memory from the stack is used by all the members… Read More
Prerequisite : HeapSort  Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we… Read More
Priority Queues are abstract data structures where each data/value in the queue has a certain priority. For example, In airlines, baggage with the title “Business”… Read More
In C++, priority_queue implements heap. Below are some examples of creating priority queue of pair type. Max Priority queue (Or Max heap) ordered by first… Read More
Given an infinite stream of integers, find the k’th largest element at any point of time. It may be assumed that 1 <= k <=… Read More
There were a total of 3 rounds. 1st was online coding, 2nd was written coding and last round was divided in three parts, basically 3… Read More
Given k sorted arrays of possibly different sizes, merge them and print the sorted output.Examples:  Input: k = 3 arr[][] = { {1, 3}, {2,… Read More
Least Frequently Used (LFU) is a caching algorithm in which the least frequently used cache block is removed whenever the cache is overflowed. In LFU… Read More