Coding (Algo)

Count Reachable Services

Algorithm: Graph traversal Difficulty: Easy Time: 25 minutes

Goal

Count the distinct nodes reachable from source by following zero or more directed edges and ignoring repeated visits.

What this task practices

Count Reachable Services 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.