AppliedAIPrep logoAppliedAI/Prep
← Coding & DSA / 106
mediumGoogleAmazonMicrosoft

Bellman-Ford: shortest paths with negative edges and negative-cycle detection.

Bellman-Ford handles negative edge weights that break Dijkstra and detects negative cycles, the basis of currency-arbitrage problems. The signal is the V-1 relaxation rounds and the extra Vth round that flags a negative cycle. Here is the answer.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

Bellman-Ford handles negative edge weights that break Dijkstra and detects negative cycles, the basis of currency-arbitrage problems. The signal is the V-1 relaxation rounds and the extra Vth round that flags a negative cycle. Here is the answer.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew
UP NEXT ON YOUR JOURNEY
Next in this trackFloyd-Warshall: all-pairs shortest paths with a three-loop dynamic program.Next in this trackKruskal's algorithm: minimum spanning tree via sorted edges and union-find.Next in this trackKMP string matching: find a pattern in O(n+m) using the prefix-function failure links.
DISCUSSION · 0

No comments yet — be the first to share your approach.