← Goldman Sachs questions

Dijkstra's shortest path

Filed under Goldman Sachs

Implement Dijkstra's shortest path algorithm to find the shortest path from a source node to all other nodes in a weighted graph using a priority queue.

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 Goldman Sachs questions

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