C++ | Hashmap | Easy
UPVOTE IF IT HELPS\n\n\'\'\'\n\n\tclass Solution {\n\tpublic:\n    bool findSubarrays(vector& nums) {\n        unordered_map mp;\n        \n        for(int i=0;
**UPVOTE IF IT HELPS**\n\n\'\'\'\n\n\tclass Solution {\n\tpublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_map<int,int> mp;\n        \n        for(int i=0; i<nums.size()-1; i++ ){\n            mp[nums[i] + nums[i+1]]++ ;\n            if( mp[nums[i] + nums[i+1]] >= 2 ){\n                return true;\n            }\n        }\n        \n        return false;\n    }\n\t};\n\n\'\'\'
['C', 'C++']