Coding (Algo)

Shortest Delivery Costs

Algorithm: Shortest path Difficulty: Medium Time: 45 minutes

Goal

Return minimum directed path costs from source in hub-ID order. Do not return paths or confuse a direct link with the cheapest multi-link route.

What this task practices

Shortest Delivery Costs 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.