# Potentials Reduced Cost Dijkstra: Study Guide

Potentials Reduced Cost Dijkstra shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

After Bellman-Ford (or a previous shortest-path tree) computes potentials, reduced costs c_pi(u,v) = c(u,v) + pi(u) - pi(v) are nonnegative so later shortest paths use Dijkstra.

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

One Bellman-Ford plus Dijkstra per successive path.

## Common mistake

Reusing stale potentials after a residual graph change without adding the latest distances, which can reintroduce negatives.

## 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 best AI tool for coding tests and OAs.