Given an integer array nums, return the maximum length of a contiguous subarray that is either strictly increasing or strictly decreasing.

A subarray is strictly increasing if every element is greater than the previous element. A subarray is strictly decreasing if every element is less than the previous element.

Constraints:

• $1 \leq$ nums.length $\leq 50$

• $1 \leq$ nums[i] $\leq 50$

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.