You are given an integer array nums.

You must remove a prefix from nums such that the remaining array is strictly increasing.

Return the minimum length of the prefix that needs to be removed.

Note: An array is considered strictly increasing if every element is strictly greater than the element immediately preceding it. An array with $0$ or $1$ element is also strictly increasing.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $-10^9 \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.