# | Status | Problem | video | Level | Completes | Likes |
---|---|---|---|---|---|---|
185 |
|
Generate Maximum revenue by selling K tickets from N windows |
Medium | % | 0 | |
154 |
|
Priority Queue in Data Structure |
Beginner | % | 0 | |
143 |
|
Merge K Sorted Arrays |
Hard | % | 0 | |
129 |
|
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 |