# Dinic Blocking Flow Levels: Interview Notes
Dinic Blocking Flow Levels shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS builds a level graph and DFS sends blocking flow so each phase increases the shortest residual s-t distance; link-cut or dynamic trees can speed the blocking-flow step.
## 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(n^2 m) generally, O(n m) on unit networks, faster with dynamic trees.
## Common mistake
Allowing a DFS to use an edge that leaves the level graph, which can loop inside a phase.
## 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 interview assistant.