Coding (Algo)

Depth of a Nested Index

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

Goal

Return the number of reachable nodes on the longest path from the root to a leaf.

What this task practices

Depth of a Nested Index 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.