You are given an integer array nums indexed starting at $0$. In one operation, you can choose an element of the array and increment its value by $1$.

Return the minimum number of operations needed to make nums strictly increasing.

An array nums is strictly increasing if nums[i] $<$ nums[i + 1] for all $0 \leq$ i $<$ nums.length $- 1$. An array of length $1$ is strictly increasing trivially.

Constraints:

• $1 \leq$ nums.length $\leq 5000$

• $1 \leq$ nums[i] $\leq 10^4$

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.