You are given an array nums consisting of positive integers.

In one operation, you can select an index i such that $0 \leq i <$ nums.length $- 1$ and replace either nums[i] or nums[i + 1] with the greatest common divisor of nums[i] and nums[i + 1].

Return the minimum number of operations required to make all elements in nums equal to $1$. If it is impossible to make every element equal to $1$, return $-1$.

Constraints:

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

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

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.