You are given an integer array nums.

You are allowed to replace at most $1$ element in nums with any integer value.

Return the maximum length of a contiguous non-decreasing subarray that can be obtained after performing at most $1$ replacement.

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.