Heap Serial No. Questions 1 Implement a Maxheap/MinHeap using arrays and recursion. 2 Sort an Array using heap. (HeapSort) 3 Maximum of all subarrays of size k. 4 “k” largest element in an array 5 Kth smallest and largest element in an unsorted array 6 Merge “K” sorted arrays. [ IMP ] 7 Merge 2 Binary Max Heaps 8 Kth largest sum continuous subarrays 9 Leetcode- reorganize strings 10 Merge “K” Sorted Linked Lists [V.IMP] 11 Smallest range in “K” Lists 12 Median in a stream of Integers 13 Check if a Binary Tree is Heap 14 Connect “n” ropes with minimum cost 15 Convert BST to Min Heap 16 Convert min heap to max heap 17 Rearrange characters in a string such that no two adjacent are same. 18 Minimum sum of two numbers formed from digits of an array