# Quake Heap Tournament: Practice Notes

Quake Heap Tournament shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Store items in a tournament of linked lists per height and rebuild a height when too many nodes of that height have been deleted (a quake).

## 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

Amortized O(log n) operations with a simple rebuild potential.

## Common mistake

Rebuilding a height too late, after more than a constant fraction of its nodes are gone, which lets degrees explode.

## 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 AI help for online coding assessments.