You are given a $0$ indexed integer array nums and an integer threshold.

Find the maximum length of a contiguous subarray starting at index l and ending at index r ($l \leq r$) that satisfies the following conditions:

• nums[l] % $2 = 0$

• nums[i] % $2 \neq$ nums[i + $1$] % $2$ for every index $i$ where $l \leq i < r$

• nums[i] \leq threshold for every index $i$ where $l \leq i \leq r$

Return the length of the longest subarray that meets these conditions, or $0$ if no such subarray exists.

Constraints:

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

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

• $1 \leq$ threshold $\leq 100$

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.