Easy CPP solution using set
\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_set<int> sumOfElements;\n        for(int i=0;i<nums.size()-1;i++){\n
```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_set<int> sumOfElements;\n        for(int i=0;i<nums.size()-1;i++){\n            int sum=nums[i]+nums[i+1];\n            sumOfElements.insert(sum);\n        }\n        if(sumOfElements.size()==nums.size()-1){\n            return false;\n        }\n        else{\n            return true;\n        }\n    }\n};\n```
['C', 'Ordered Set', 'C++']