You are given an integer array nums. You may replace at most $1$ element in nums with any integer.

Return the maximum length of a contiguous arithmetic subarray that can be formed after at most $1$ modification.

Note: A sequence is arithmetic if the difference between consecutive elements is constant. A subarray is a contiguous sequence of elements within an array.

Constraints:

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