# Interval Heap Double Ended: Interview Notes
Interval Heap Double Ended shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Pair the smallest and largest remaining keys in each node of a heap shape so both extract-min and extract-max are supported.
## 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(log n) insert and extract of either extreme.
## Common mistake
Swapping a new key with the wrong endpoint of its interval, which can invert the min/max pairing inside a node.
## 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 undetectable AI interview copilot.