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