A directed graph started as a rooted tree with $n$ nodes labeled from $1$ to $n$, having exactly one root node with no incoming edges and every other node having exactly $1$ incoming edge, such that all nodes are reachable from the root.

An additional directed edge was added to the tree. The resulting graph is provided as a $2$D array edges of length $n$, where edges[i] = [u_i, v_i] represents a directed edge pointing from node u_i to node v_i.

Return an edge that can be removed so that the remaining graph is a valid rooted tree of $n$ nodes. If multiple answers exist, return the edge that appears last in the given edges array.

Constraints:

• n $==$ edges.length

• $3 \leq$ n $\leq 1000$

• edges[i].length $== 2$

• $1 \leq$ u_i, v_i $\leq$ n

• u_i $\neq$ v_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.