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

- Max Heap in Python
- Min Heap in Python
- Real-time application of Data Structures
- Maximum Possible Rating of a Coding Contest
- Maximum CPU Load from the given list of jobs
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Find Non-overlapping intervals among a given set of intervals
- Minimum cost to merge numbers from 1 to N
- Array value by repeatedly replacing max 2 elements with their absolute difference
- Count of pairs from arrays A and B such that element in A is greater than element in B at that index
- Longest subarray with absolute difference between elements less than or equal to K using Heaps
- Weak Heap
- std::is_heap( ) in C++ with Examples
- Reduce the array to atmost one element by the given operations
- Merge first two minimum elements of the array until all the elements are greater than K
- Path with smallest product of edges with weight >= 1
- Last element remaining by deleting two largest elements and replacing by their absolute difference if they are unequal
- Flattening a linked list | Set 2
- Print all the leaf nodes of Binary Heap
- Maximize jobs that can be completed under given constraint
- Complexity analysis of various operations of Binary Min Heap

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},… 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 »

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 »

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 »

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 »

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 »

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