← Amazon questions

Shortest Path with One Additional Edge

Filed under Amazon

Given a directed graph with non-negative weights, find the shortest path from source S to destination D, allowing the addition of exactly one edge (u, v) with weight w between any two nodes u and v…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.