[C++] | Easy solution | Space lesser than 97%
We know there exists a solution for ax+by =1 when there exists a , b such that their hcf is 1.\nIf we find 2 nums whose hcf is 1 we return true; else return fal
We know there exists a solution for `ax+by =1` when there exists a , b such that their hcf is 1.\nIf we find 2 nums whose hcf is 1 we `return true;` else `return false;` .\n```\nbool isGoodArray(vector<int>& nums) {\n        int n=nums.size();\n        if(!n) return false;\n        int hcf=nums[0];\n\t\t\n        for(int i=1;i<n;i++){\n            hcf=__gcd(hcf,nums[i]);\n        }\n\t\t\n        return hcf==1;\n    }
['C', 'C++']