Coding (Algo)

Discounted Service Route

Algorithm: Shortest path Difficulty: Hard Time: 65 minutes

Goal

Find the minimum source-to-target cost when at most one traversed connection may cost floor(cost / 2).

What this task practices

Discounted Service 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 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.