Maximum element in min heap
Given a min heap, find the maximum element present in the heap. Examples: Input : 10 / \ 25 23 / \ / \ 45… Read More »
Category Archives: Heap
Minimum element in a max heap
Given a max heap, find the minimum element present in the heap. Examples: Input : 100 / \ 75 50 / \ / \ 55… Read More »
Sort a nearly sorted array using STL
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 »
Where is an object stored if it is created inside a block in C++?
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 »
Python Code for time Complexity plot of Heap Sort
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 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 »
