Easy Solution C++
c++\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_map<int, bool> sumExists;\n        int i = 1, n = nums.size();\n 
```c++\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_map<int, bool> sumExists;\n        int i = 1, n = nums.size();\n        while (i < n) {\n            int sum = nums[i - 1] + nums[i++];\n            if (sumExists[sum]) return true;\n            else sumExists[sum] = true;\n        }\n        return false;\n    }\n};\n```\n\nIn the code above we are finding the sum of every two consecutive element in the array, and if the sum exists we return true else false;
['C']