Linear Combination possible if subset with GCD 1 exists
\nclass Solution:\n    def gcd(self, a, b):\n        while b:\n            a, b = b, a % b\n        return a\n    \n    def isGoodArray(self, nums: List[int]) -
```\nclass Solution:\n    def gcd(self, a, b):\n        while b:\n            a, b = b, a % b\n        return a\n    \n    def isGoodArray(self, nums: List[int]) -> bool:\n        n = len(nums)\n        curr = nums[0]\n        for i in range(1, n):\n            curr = self.gcd(curr, nums[i])\n            if curr == 1:\n                return True\n        return curr == 1\n```
['Python']