# Capacity Scaling Max Flow: Walkthrough
Capacity Scaling Max Flow shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Only consider residual edges whose capacity is at least a current delta, then halve delta so large augmentations are found first and the number of phases is logarithmic.
## 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(m^2 log U) or better with blocking flows per scale.
## Common mistake
Halving delta before residual capacities from the previous scale have been fully exhausted.
## 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 real-time AI interview assistant for live interviews.