There are stones placed at distinct integer coordinates along a number line, represented by the integer array stones.

A move consists of selecting an endpoint stone (the stone located at either the minimum or maximum position) and placing it onto an unoccupied position such that it is no longer an endpoint stone. The game finishes when no valid moves remain, which happens when all stones occupy consecutive positions.

Return an array answer of length $2$ where answer[0] is the minimum number of moves and answer[1] is the maximum number of moves possible until the game finishes.

Constraints:

• $3 \le$ stones.length $\le 10^4$

• $1 \le$ stones[i] $\le 10^9$

• All the values of stones 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.