Given an array of distinct integers arr and an integer k.

A game is played between the first two elements of arr. In each round:

• The larger of arr[0] and arr[1] wins and remains at index $0$.

• The smaller element loses and is moved to the end of arr.

The game continues until an element achieves k consecutive round victories.

Return the integer that wins the game.

Note: It is guaranteed that a winner exists.

Constraints:

• $2 \leq$ arr.length $\leq 10^5$

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

• arr contains distinct integers.

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

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.