# Strict Fibonacci Heap Bounds: Walkthrough

Strict Fibonacci Heap Bounds shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Maintain the Fibonacci-heap degree bound after every operation rather than lazily, using active and passive trees so the worst-case costs match the amortized ones.

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

Worst-case O(1) decrease-key and O(log n) delete-min.

## Common mistake

Leaving a tree passive when its rank should have been fixed immediately, which lets a later delete-min see an oversized degree.

## 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 the Linkjob AI app.