Coding (Algo)

Find a Complete Path Total

Algorithm: Depth first search Difficulty: Easy Time: 25 minutes

Goal

Return whether at least one reachable root-to-leaf path has node values summing exactly to target.

What this task practices

Find a Complete Path Total 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 easy 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.