Simple C++ solution
Code\n\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_map<int,int> mp;\n        for(int i=1;i<nums.size();i++){\n   
# Code\n```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_map<int,int> mp;\n        for(int i=1;i<nums.size();i++){\n            int sum=nums[i-1]+nums[i];\n            if(mp.find(sum)!=mp.end()){\n                return true;\n            }\n            mp[sum]++;\n        }   \n        return false;\n    }\n};\n```
['C++']