Given a $0$ indexed integer array nums, return true if it can be made strictly increasing after removing exactly one element, or false otherwise. If the array is already strictly increasing, removing any single element will also result in a strictly increasing array.

Note: An array arr is strictly increasing if arr[i - 1] < arr[i] holds for every index $i$ such that $1 \leq i <$ arr.length.

Constraints:

• $2 \leq$ nums.length $\leq 1000$

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

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.