# Successive Shortest Min Cost: Interview Notes

Successive Shortest Min Cost shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Send flow along shortest (potentially residual) paths with potentials so reduced costs stay non-negative and Dijkstra can replace Bellman-Ford after the first iteration.

## 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(F (m + n log n)) with potentials, or cheaper with capacity scaling.

## Common mistake

Skipping the potential update after a shortest-path computation, which lets Dijkstra see negative reduced costs.

## 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 interview assistant.