Available question text
Given a functional directed graph (each node has exactly one outgoing edge), compute for every node how many distinct nodes are visited when repeatedly following edges until a node repeats. The core challenge is detecting cycles and efficiently computing cycle sizes and distances from nodes to their cycles (n up to 1e5).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2876. Count Visited Nodes in a Directed Graph
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source