You are given an integer n representing the number of nodes labeled from $0$ to $n - 1$, and a list edges of directed edges where each edges[i] = [u_i, v_i] indicates a one way edge from u_i to v_i.

If you ignore edge directions, the underlying graph forms a tree. For each node x, determine the minimum number of edges that must be reversed so that starting from x, it is possible to reach every other node by following directed edges.

Return an array answer of length n where answer[x] is this minimum number of reversals for node x.

Note: Reversing an edge changes its direction from u -> v to v -> u.

Constraints:

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

• edges.length $=$ n $- 1$

• edges[i].length $= 2$

• $0 \leq$ u_i $=$ edges[i][0] $<$ n

• $0 \leq$ v_i $=$ edges[i][1] $<$ n

• u_i $\neq$ v_i

• The input is generated such that if all edges were treated as bidirectional, the graph would be a tree.

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.