# Johnson All Pairs Potentials: Explained

Johnson All Pairs Potentials shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Add a virtual source, compute potentials with Bellman-Ford, reweight every edge to be nonnegative, then run Dijkstra from each vertex.

## 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 m + n^2 log n) typical.

## Common mistake

Skipping the virtual-source step on a graph that already has negatives, which lets Dijkstra see a negative 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 AI job search and interview copilot.