AppliedAIPrep logoAppliedAI/Prep
← Coding & DSA / 107
mediumGoogleAmazonMicrosoft

Floyd-Warshall: all-pairs shortest paths with a three-loop dynamic program.

Floyd-Warshall computes shortest paths between every pair of nodes in O(V cubed) with a tight three-line triple loop. The signal is the intermediate-node DP order and why k must be the outer loop. Here is the answer.

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

Floyd-Warshall computes shortest paths between every pair of nodes in O(V cubed) with a tight three-line triple loop. The signal is the intermediate-node DP order and why k must be the outer loop. 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 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.Next in this trackRabin-Karp: substring search and multi-pattern matching with a rolling hash.
DISCUSSION · 0

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