Set 25 - Heap / Priority Queue
Use Practice Loop if you need a reset.
Problems
| Problem | Difficulty | Pattern | Video |
|---|---|---|---|
| LC 355. Design Twitter | Medium | Merge K + Heap | Video |
| LC 295. Find Median from Data Stream | Hard | Two Heaps | Video |
| LC 23. Merge K Sorted Lists | Hard | Min Heap | 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 355: merge K streams with heap; store timestamps.
- LC 295: two heaps; balance sizes for median.
- LC 23: min-heap of list heads; pop/push.
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...