Back to sheet
FAANG+ Advanced Sheet
Heaps & Design
13 problems
problem
Topic Progress0 / 13 solved
Problem List
Work through the problems in sequence to build topic mastery.
| Problem | Difficulty | Status | Optional | Action |
|---|---|---|---|---|
| Top K Frequent Elements | Medium | Unsolved | Required | |
| Kth Largest Element In An Array | Medium | Unsolved | Required | |
| K Closest Points To Origin | Medium | Unsolved | Required | |
| Find K Pairs With Smallest Sums | Medium | Unsolved | Required | |
| Task Scheduler | Medium | Unsolved | Required | |
| Merge K Sorted Lists | Medium | Unsolved | Required | |
| Find Median From Data Stream | Medium | Unsolved | Required | |
| LRU Cache | Medium | Unsolved | Required | |
| Time Based Key-Value Store | Medium | Unsolved | Required | |
| Insert Delete GetRandom O(1) | Medium | Unsolved | Required | |
| Design Twitter | Medium | Unsolved | Required | |
| Number Of Recent Calls | Medium | Unsolved | Required | |
| Min Stack | Medium | Unsolved | Required |
Topic Snapshot
A compact summary of what this sheet section covers and how far you have progressed.
Heaps & Design
Finish with priority queues, stream state, cache APIs, randomized maps, and time-indexed stores.
faang-plus
advanced
Completion
0%
Problems Remaining
13
Optional Problems
0
Complete the required items first, then use optional problems for extra depth.