← Deutsche Bank questions
CodingReported in a candidate post, Apr 2025

Dijkstra algorithm code and where it fails

Filed under Deutsche Bank

Write Dijkstra's algorithm to find the shortest distance from a source vertex to every other vertex in a weighted directed graph, and explain in which situations it fails.

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.