You are given a $0$ indexed integer array nums. A subarray of nums of length m (where $m > 1$) is considered alternating if:

• nums[i + 1] - nums[i] = 1 for all even indices i where $0 \leq i < m - 1$

• nums[i + 1] - nums[i] = -1 for all odd indices i where $0 \leq i < m - 1$

Return the maximum length of any alternating subarray in nums. If no alternating subarray exists, return $-1$.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^4$

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.