# Capacity Scaling Maximum Flow: Explained
Capacity Scaling Maximum 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 threshold Delta, send flow, then repeatedly halve Delta until every residual edge is eligible.
## 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(E^2 log U) with DFS augmentations per scale.
## Common mistake
Lowering Delta before the current scale is saturated, which wastes large leftover 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 job search and interview copilot.