Heap

Implement a Maxheap/MinHeap using arrays and recursion.

Sort an Array using heap. (HeapSort)

Maximum of all subarrays of size k.

“k” largest element in an array

Kth smallest and largest element in an unsorted array

Merge “K” sorted arrays. [ IMP ]

Merge 2 Binary Max Heaps

Kth largest sum continuous subarrays

Leetcode- reorganize strings

Merge “K” Sorted Linked Lists [V.IMP]

Smallest range in “K” Lists

Median in a stream of Integers

Check if a Binary Tree is Heap

Connect “n” ropes with minimum cost

Convert BST to Min Heap

Convert min heap to max heap

Rearrange characters in a string such that no two adjacent are same.

Minimum sum of two numbers formed from digits of an array