You are given a $0$ indexed array of positive integers nums.

A subarray is called incremovable if, after removing it, the remaining elements of nums are strictly increasing.

Return the total number of incremovable subarrays in nums.

Note: An empty remaining sequence is also considered strictly increasing. A subarray is a contiguous non empty sequence of elements within an array.

Constraints:

• $1 \leq$ nums.length $\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.