McKinsey
3 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2530. Maximal Score After Applying K Operations | Medium | 100% | TopicsArrayGreedyHeap (Priority Queue) |
| 934. Shortest Bridge | Medium | 100% | TopicsArrayDepth-First SearchBreadth-First SearchMatrix |
| 1208. Get Equal Substrings Within Budget | Medium | 69.5% | TopicsStringBinary SearchSliding WindowPrefix Sum |
