Playbook / Staff+ coding
Staff+ coding
High-signal coding with Staff+ extensions
| # | Title | |
|---|---|---|
| 01 | Staff+ coding bar — how this round is graded | Study → |
| 02 | Implement an LRU cache (Staff+ concurrency extension) | Study → |
| 03 | Implement a token-bucket rate limiter (in-process) | Study → |
| 04 | Time-based key-value store | Study → |
| 05 | Concurrent bounded blocking queue | Study → |
| 06 | Top-K frequent elements (stream-aware) | Study → |
| 07 | Merge K sorted lists / iterators | Study → |
| 08 | Clone a graph (cycle-safe) | Study → |
| 09 | Debug: broken cache eviction | Study → |
| 10 | Design an in-memory pub/sub (LLD in code) | Study → |
| 11 | Prefix-sum subarray patterns (Staff+ follow-ups) | Study → |
| 12 | Implement consistent hashing with virtual nodes | Study → |
| 13 | Design an elevator system (LLD / machine coding) | Study → |
| 14 | Design a parking lot (LLD / machine coding) | Study → |
| 15 | Implement a Trie / prefix tree (Staff+ autocomplete extension) | Study → |
| 16 | Find median from a data stream (Staff+ concurrent extension) | Study → |
| 17 | Serialize and deserialize a binary tree (Staff+ schema extension) | Study → |
| 18 | Design a hit counter (Staff+ distributed extension) | Study → |
| 19 | Implement a circuit breaker (Staff+ resilience extension) | Study → |
19 of 19 · total playbook 81