C++ | Hashmap | Very Easy Code
Please Upvote :)\n\n\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_map<int,int> m;\n        for(int i=0;i<nums.size
Please Upvote :)\n\n```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_map<int,int> m;\n        for(int i=0;i<nums.size()-1;i++)\n        {\n            int c=nums[i]+nums[i+1];\n            if(m.find(c)!=m.end())\n                return 1;\n            m[c]=1;\n        }\n        return 0;\n    }\n};\n```
['C', 'C++']