You are given a directed graph with $n$ nodes labeled from $0$ to $n - 1$. The graph is represented by a $0$ indexed integer array edges of length $n$, where a directed edge exists from node i to node edges[i].

The edge score of a node is defined as the sum of the labels of all nodes that have a directed edge pointing to that node.

Return the node with the highest edge score. If multiple nodes have the same highest edge score, return the node with the smallest index.

Constraints:

• n $==$ edges.length

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

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

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