Learning
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 1223 | Heaps (Theory Video) | Easy | Learning | A2Z |
| 576 | Implement Min Heap | Medium | Learning | A2Z |
| 571 | Check if an array represents a min heap | Medium | Learning | A2Z |
| 572 | Convert Min Heap to Max Heap | Medium | Learning | A2Z |
| 575 | Implement Max Heap | Medium | Learning | SDE |
Medium Problems
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 578 | K-th Largest element in an array | Medium | Medium Problems | A2Z SDE |
| 2840 | Kth smallest element in an array [use priority queue] | Medium | Medium Problems | A2Z |
| 2409 | Sort K sorted array | Easy | Medium Problems | A2Z |
| 569 | Merge K sorted Lists | Hard | Medium Problems | A2Z |
| 898 | Replace Elements by Their Rank | Easy | Medium Problems | A2Z |
| 1008 | Task Scheduler | Medium | Medium Problems | A2Z |
| 556 | Hand of Straights | Medium | Medium Problems | A2Z |
| 713 | Merge K Sorted Arrays | Medium | Medium Problems | SDE B75 |
| 2839 | K-th largest element in an unsorted array. | Medium | Medium Problems | SDE |
Hard Problems
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 565 | Design Twitter | Medium | Hard Problems | A2Z |
| 755 | Minimum Cost to Connect Sticks | Medium | Hard Problems | A2Z |
| 2838 | Kth largest element in a stream of running integers | Hard | Hard Problems | A2Z |
| 568 | Maximum Sum Combination | Hard | Hard Problems | A2Z SDE |
| 566 | Find Median from Data Stream | Hard | Hard Problems | A2Z SDE B75 |
| 1018 | Top K Frequent Elements | Medium | Hard Problems | A2Z SDE B75 |
| 446 | Find Median in a Stream | Medium | Hard Problems | SDE |
| 567 | Kth largest element in a stream of running integers | Hard | Hard Problems | SDE |