# Category Archives: Heap

## Priority Queue in Python

Priority Queue is an extension of the queue with following properties. 1) An element with high priority is dequeued before an element with low priority.… Read More »

## Priority queue of pairs in C++ (Ordered by first)

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 »

## Kth smallest element after every insertion

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 »

## Microsoft Interview experience | Set 178 (On-Campus Internship for IDC)

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 »

## Merge k sorted arrays | Set 2 (Different Sized Arrays)

Given k sorted arrays of possibly different sizes, merge them and print the sorted output. Examples: Input: k = 3 arr[][] = { {1, 3},… Read More »

## Least Frequently Used (LFU) Cache Implementation

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 »

## Top 10 algorithms in Interview Questions | Set 2

In the previous post, top 10 algorithms/questions on different topics that are most asked in interviews is discussed. In this post, top 10 problems on… Read More »

## Convert BST to Max Heap

Given a Binary Search Tree which is also a Complete Binary Tree. The problem is to convert a given BST into a Special Max Heap… Read More »

## Program for Preemptive Priority CPU Scheduling

Implementing priority CPU scheduling. In this problem, we are using Min Heap as the data structure for implementing priority scheduling. In this problem smaller numbers… Read More »

## Minimum increment/decrement to make array non-Increasing

Given an array a, your task is to convert it into a non-increasing form such that we can either increment or decrement the array value… Read More »

## Height of a complete binary tree (or Heap) with N nodes

Consider a Binary Heap of size N. We need to find height of it. Examples : Input : N = 6 Output : 2 ()… Read More »

## Skew Heap

A skew heap (or self – adjusting heap) is a heap data structure implemented as a binary tree. Skew heaps are advantageous because of their… Read More »

## 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 »

## Iterative HeapSort

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 »

## Maximum difference between two subsets of m elements

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 »