Coding (Algo)

List Destinations Within Budget

Algorithm: Dijkstra Difficulty: Medium Time: 40 minutes

Goal

Return reachable node labels whose minimum route cost does not exceed budget ordered by minimum cost and then numeric label.

What this task practices

List Destinations Within Budget 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.