← Deutsche Bank questions

Shortest path from node 1 to node N

Filed under Deutsche Bank

Design and explain an algorithm to compute the shortest path distance between node 1 and node N in a weighted graph.

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 Deutsche Bank questions

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