# Hollow Heap Decrease Key: Explained

Hollow Heap Decrease Key shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

On decrease-key, leave the old node hollow and attach a new node with the reduced key, so cascading cuts are never needed.

## 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(1) decrease-key and O(log n) delete-min.

## Common mistake

Physically deleting a decreased node instead of hollowing it, which reintroduces cascading-cut complexity.

## 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 www.linkjob.ai.