Knowledge Check

Depth-first search evidence

While reviewing trees graphs, a dependency graph needs complete reachability. Which action fixes it, and which check proves it worked?

What this task practices

Depth-first search evidence is a knowledge check 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 Trees Graphs, Depth First Search. 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.