# Hollow Heap Lazy Deletion: Practice Notes
Hollow Heap Lazy Deletion shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Mark deleted nodes hollow and leave them until a later find-min unrolls the hollow chain, avoiding immediate structural work.
## 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 insert, O(log n) delete-min.
## Common mistake
Physically removing a hollow node immediately, which reintroduces expensive cuts.
## 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 assistant for technical interviews.