# Push-Relabel FIFO Maximum Flow: Practice Notes
Push-Relabel FIFO Maximum Flow shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Keep overflowing vertices in a queue; discharge the front vertex with push and relabel until its excess is zero, then enqueue newly overflowing neighbors.
## 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(V^3) with FIFO selection.
## Common mistake
Relabeling without first trying every admissible outgoing edge.
## 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 https://www.linkjob.ai/.