Ibm - Heap (Priority Queue)
Heap (Priority Queue) questions asked by Ibm
Total: 13
Easy: 2
Medium: 9
Hard: 2
Progress: 0%
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Maximum Median Sum of Subsequences of Size 3 | Visit | Medium | |
| 2 | Minimum Operations to Make Median of Array Equal to K | Visit | Medium | |
| 3 | Minimum Number of Changes to Make Binary String Beautiful | Visit | Medium | |
| 4 | Minimize XOR | Visit | Medium | |
| 5 | Maximum Units on a Truck | Visit | Easy | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 13 questions for free!
Log In