Given an array of integers nums, split nums into the minimum number of contiguous subarrays such that the greatest common divisor (GCD) of all elements in each subarray is strictly greater than $1$.

Return the minimum number of subarrays required to achieve this split.

Note: A subarray is a contiguous non empty sequence of elements within an array. The greatest common divisor ($ ext{GCD}$) of a sequence of integers is the largest positive integer that evenly divides each integer in the sequence.

Constraints:

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

• $2 \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.