CodingReported in a candidate post, Nov 2021
Shortest path edge identification
Filed under Indeed
The question
Given a graph with weighted edges, a start node, and an end node, identify which edges belong to any of the shortest paths between the start and end nodes.
No write-up yet. Related questions below have one.
Related Indeed questions
Collected from public candidate posts and coding forums. Updated Nov 2026.