There are $n$ players numbered from $0$ to $n - 1$ standing in a queue in order of their indices. You are given an integer array skills of size $n$, where skills[i] represents the skill level of player i. All elements in skills are distinct. You are also given an integer k.

The competition proceeds in consecutive rounds as follows:

• The first two players at the front of the queue play a match against each other.

• The player with the strictly greater skill level wins the match.

• The winner remains at the front of the queue, while the loser moves to the very back of the queue.

The competition ends as soon as any player achieves $k$ consecutive victories.

Return the initial index of the player who wins $k$ games in a row.

Constraints:

• n $==$ skills.length

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

• $1 \leq k \leq 10^9$

• $1 \leq$ skills[i] $\leq 10^6$

• All integers in skills are unique.

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.