There is a directed graph consisting of n nodes labeled from $0$ to n $- 1$. Each node i has exactly one outgoing directed edge to edges[i].

Starting from a node i, the process moves along the graph by continually following the outgoing edges until a node that has already been visited during the current traversal is reached.

Return an array ans of size n, where ans[i] is the total number of distinct nodes visited when beginning the traversal from node i.

Constraints:

• n $==$ edges.length

• $2 \leq$ n $\leq 10^5$

• $0 \leq$ edges[i] $\leq$ n $- 1$

• edges[i] $\neq$ i

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.