You are given a $2 ext{D}$ integer array events where each events[i] = [index_i, time_i] indicates that the button with index index_i was pressed at time time_i.

The time taken to press the initial button is time_0. For each subsequent button press $i > 0$, the time taken is calculated as time_i $-$ time_{i-1}.

Return the index of the button that required the maximum push time. If there is a tie, return the smallest button index.

Constraints:

• $1 \leq$ events.length $\leq 1000$

• events[i] == [index_i, time_i]

• $1 \leq$ index_i, time_i $\leq 10^5$

• The input is generated such that events is sorted in increasing order of time_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.