Given an integer array nums, you can remove at most $1$ element from the array.

An array is considered alternating if its length is $1$, or if every adjacent pair of elements alternates strictly between increasing and decreasing relations (either nums[0] < nums[1] > nums[2] < nums[3] ... or nums[0] > nums[1] < nums[2] > nums[3] ...).

Return the maximum length of an alternating contiguous subarray you can obtain after removing at most $1$ element.

Constraints:

• $2 \leq$ nums.length $\leq 10^5$

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