← Flipkart questions
CodingMedium

Implement Dijkstra's algorithm for finding shortest path in a weighted graph

Filed under Flipkart

Implement Dijkstra's algorithm to find the shortest path from a source node to all other nodes in a weighted graph with non-negative edge weights. The graph is represented as an adjacency list where…

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 Flipkart questions

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