Coding (Algo)

Find the Cheapest Directed Route

Algorithm: Dijkstra Difficulty: Medium Time: 40 minutes

Goal

Return the minimum sum of edge weights from source to target or null when no valid route connects them.

What this task practices

Find the Cheapest Directed Route 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.