Coding (Algo)

Find the Fewest Handoffs

Algorithm: Shortest path Difficulty: Medium Time: 40 minutes

Goal

Return the minimum number of directed edges from source to target or null if either endpoint is missing or the target is unreachable.

What this task practices

Find the Fewest Handoffs 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.