Algorithm: Shortest path Difficulty: Medium Time: 40 minutes
Goal
Return each edge’s source label and destination label with slack equal to distance[from] plus weight minus distance[to].
Coding (Algo)
Algorithm: Shortest path Difficulty: Medium Time: 40 minutes
Return each edge’s source label and destination label with slack equal to distance[from] plus weight minus distance[to].
Explain Unused Route Connections is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as medium difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.