Find the Shortest Distance in a Weighted Undirected Graph
Company: Visa
Role: Software Engineer I
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Online Assessment
Overview: Find the minimum total weight between two vertices in a large undirected graph with positive edges. Build an adjacency list, run Dijkstra with a priority queue and stale-entry checks, use wide distances, and return a clear sentinel when no path exists.
Read the full Visa Software Engineer I interview experience this question came from