← Deutsche Bank questions
CodingMediumReported in a candidate post, Jul 2022

Shortest path using BFS or Dijkstra

Filed under Deutsche Bank

Solve a graph traversal problem requiring BFS or Dijkstra's algorithm to determine the shortest path or optimal cost from a source to a destination.

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.