Given an array of positive integers nums.

A subarray of nums is defined as product equivalent if the product of all its elements is equal to the product of the greatest common divisor ($\gcd$) and the least common multiple ($\operatorname{lcm}$) of all its elements.

Return the maximum length of a product equivalent subarray of nums.

Constraints:

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

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

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.