✅C++ | ✅Use Hashmap | ✅Easy and Efficient
\nclass Solution \n{\npublic:\n    bool findSubarrays(vector<int>& nums) \n    {\n        unordered_map<int, int> mp;\n        int sum=0;\n        \n        for
```\nclass Solution \n{\npublic:\n    bool findSubarrays(vector<int>& nums) \n    {\n        unordered_map<int, int> mp;\n        int sum=0;\n        \n        for(int i=0; i<nums.size()-1; i++)\n        {\n            sum = nums[i]+nums[i+1];\n            mp[sum]++;\n        }\n        \n        for(auto it:mp)\n        {\n            if(it.second>1)\n                return true;\n        }\n        return false;\n    }\n};\n```
['C', 'C++']