Set 24 - Heap / Priority Queue
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 703. Kth Largest Element in Stream | Easy | Min Heap | Video |
| LC 215. Kth Largest Element in Array | Medium | Quick Select/Heap | Video |
| LC 621. Task Scheduler | Medium | Max Heap + Cooldown | Video |
Deliverables
- Write a 1-line invariant for each problem.
- Note 1 edge case or pitfall per problem.
- Record time-to-first-correct solution.
Notes
- LC 703: min-heap size k; root is kth largest.
- LC 215: quickselect or min-heap size k.
- LC 621: greedy with max heap + cooldown slots.
Review
- Time spent + where you got stuck?
- Biggest mistake or missed edge case?
- One concrete improvement for next time.
Comments
Share your approach or ask questions
?
|
Markdown supported
Sign in to post
Loading comments...