# Lazy Fibonacci Heap Decrease: Walkthrough
Lazy Fibonacci Heap Decrease shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Mark a node on its first child cut and cascade the cut to the parent on the second, so decrease-key is amortized constant while trees stay degree-bounded.
## 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
Cascading a cut after a single child loss, which over-cuts and can inflate the potential without need.
## 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 learn more.