# Global Relabeling Push Relabel Heuristic: Interview Notes

Global Relabeling Push Relabel Heuristic shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Periodically BFS backward from the sink on the residual graph and set every height to the true distance, fixing stale labels.

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

A few global relabels often dominate runtime.

## Common mistake

Running the backward BFS on the original graph instead of the residual graph.

## 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 linkjob.ai.