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

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

Return the total count of incremovable subarrays in nums.

Note: An empty remaining array is considered strictly increasing. The removed subarray must be non empty.

Constraints:

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

• $1 \leq$ nums[i] $\leq 50$

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.