Leetcode 2876. Count Visited Nodes in a Directed Graph

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2876. Count Visited Nodes in a Directed Graph

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact