# Sequence Heap Sanders Kway: Study Guide
Sequence Heap Sanders Kway shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Keep k sorted runs in a cache-friendly Knuth-style heap of buffers so a multi-way merge streams from memory at nearly sequential bandwidth.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O((n/B) log_k n) I/Os for a well-chosen k around the cache-line hierarchy.
## Common mistake
Choosing k larger than the number of cache-resident buffers, which thrashes the merge and destroys sequential throughput.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at official website.