c++ using set only
class Solution {\npublic:\n    bool findSubarrays(vector& nums) {\n        sets;\n        for(int i=0;i<=nums.size()-2;i++)\n        {\n            s.insert(num
class Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        set<int >s;\n        for(int i=0;i<=nums.size()-2;i++)\n        {\n            s.insert(nums[i]+nums[i+1]);\n        }\n        if(s.size()==(nums.size()-1)) return false;\n        return true;\n        \n    }\n};
[]