Java Solution || GCD approach
\nclass Solution {\n    \n    public int gcd(int a, int b) {\n        if(b==0)\n            return a;\n        return gcd(b,a%b);\n    }\n    \n    public boole
```\nclass Solution {\n    \n    public int gcd(int a, int b) {\n        if(b==0)\n            return a;\n        return gcd(b,a%b);\n    }\n    \n    public boolean isGoodArray(int[] nums) {\n        int ans = nums[0];\n        for (int element: nums){\n            ans = gcd(ans, element);\n            if(ans == 1){\n               return true;\n            }\n        }\n        return false;\n    }\n}\n```
['Java']