| # | Status | Problem | Level | Completes | Likes |
|---|---|---|---|---|---|
| 1 |
|
Generate Maximum revenue by selling K tickets from N windows |
Medium | % | 0 |
| 2 |
|
Priority Queue in Data Structure |
Beginner | % | 0 |
| 3 |
|
Merge K Sorted Arrays |
Hard | % | 0 |
| 4 |
|
Binary Min-Max Heap Implementation |
Hard | % | 0 |
Generate Maximum revenue by selling K tickets from N windows |
Priority Queue in Data Structure |
Merge K Sorted Arrays |
Binary Min-Max Heap Implementation |