Coding (Algo)

Count Cheapest Delivery Routes

Algorithm: Dijkstra Difficulty: Hard Time: 50 minutes

Goal

Count distinct directed routes from source to target whose total weight is minimal while treating parallel edges as distinct choices.

What this task practices

Count Cheapest Delivery Routes 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 hard 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.