Google - Heap (Priority Queue)
Heap (Priority Queue) questions asked by Google
Total: 109
Easy: 24
Medium: 48
Hard: 37
Progress: 0%
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Split Array With Minimum Difference | Visit | Medium | |
| 2 | Inverse Coin Change | Visit | Medium | |
| 3 | Minimum Operations to Make Array Elements Zero | Visit | Hard | |
| 4 | Maximum Difference Between Even and Odd Frequency II | Visit | Hard | |
| 5 | Minimum Operations to Make Character Frequencies Equal | Visit | Hard | |
| 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 109 questions for free!
Log In