Given an array of integers nums, determine the maximum length of a contiguous subarray whose elements have a strictly positive product.

Return the maximum length found. If there is no subarray with a positive product, return $0$.

Note: A subarray is a contiguous sequence of elements within an array. A product equal to $0$ is not considered positive.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $-10^9 \leq$ nums[i] $\leq 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.