Day 37

#2654.minimum-number-of-operations-to-make-all-array-elements-equal-to-1

from math import gcd
from typing import List

class Solution:
    def minOperations(self, nums: List[int]) -> int:
        n = len(nums)
        overall_gcd = nums[0]
        for num in nums:
            overall_gcd = gcd(overall_gcd, num)
        if overall_gcd != 1:
            return -1
        if 1 in nums:
            return n - nums.count(1)
        min_len = float('inf')
        for i in range(n):
            g = nums[i]
            for j in range(i + 1, n):
                g = gcd(g, nums[j])
                if g == 1:
                    min_len = min(min_len, j - i + 1)
                    break
        return (min_len - 1) + (n - 1)