You are given an integer array nums of length n.

An index i ($1 \leq$ i $\leq$ n $- 2$) is considered special if nums[i] > nums[i - 1] and nums[i] > nums[i + 1].

In a single operation, you can select any index and increase nums[i] by $1$.

Return the minimum number of operations needed to achieve the maximum possible number of special indices.

Constraints:

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

• $1 \leq$ nums[i] $\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.