Given an integer array arr, return the maximum length of a turbulent subarray of arr.

A subarray is considered turbulent if the comparison sign alternates between each consecutive pair of elements throughout the subarray.

Formally, a subarray arr[i...j] is turbulent if for every index $k$ satisfying $i \le k < j$:
• arr[k] > arr[k + 1] for odd $k$ and arr[k] < arr[k + 1] for even $k$, or
• arr[k] < arr[k + 1] for odd $k$ and arr[k] > arr[k + 1] for even $k$.

Constraints:

• $1 \le$ arr.length $\le 4 \cdot 10^4$

• $0 \le$ arr[i] $\le 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.