Fully explained || GCD || CO-Prime || CPP
Intuition here is to get a set from nums whose gcd=1 as if gcd(a,b)==1 then there exist atleast one multiple of a & b whose difference is 1:)\n\nSo in order to 
Intuition here is to get a set from nums whose gcd=1 as if gcd(a,b)==1 then there exist atleast one multiple of a & b whose difference is 1:)\n\nSo in order to check this, we can simply check the gcd of whole list because if there exist a single co-prime pair then gcd of list will be 1.\n\nPFB my code for your reference:\n```\nclass Solution {\npublic:\n    bool isGoodArray(vector<int>& nums) {\n        int n=nums.size();\n \xA0 \xA0 \xA0 \xA0/// if(n==1) return nums[0]==1;\n        int ans=nums[0];\n        for(int i=1;i<n;i++)\n            ans=__gcd(ans,nums[i]);\n        return ans==1;\n    }\n};\n```
[]