# Path With Maximum Probability: Practice Notes
Path With Maximum Probability shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Dijkstra on maximum product: store -log(prob) or a max-heap of probabilities and relax when a better product appears.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS/DFS, union-find, topological sort, or tree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(E log V).
## Common mistake
Adding probabilities instead of multiplying, or using BFS which ignores weights.
## 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/.