Given an integer array nums of length n, determine whether it can become non decreasing by modifying at most $1$ element.

An array nums is non decreasing if nums[i] $\leq$ nums[i + 1] holds for every index i such that $0 \leq$ i $\leq$ n $- 2$.

Constraints:

• n $==$ nums.length

• $1 \leq$ n $\leq 10^4$

• $-10^5 \leq$ nums[i] $\leq 10^5$

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.