2 Easy C++ Soln
\n// method  -1 (sliding window )\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_map<int,int> mp;\n        int j = 0
```\n// method  -1 (sliding window )\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_map<int,int> mp;\n        int j = 0;\n        int i = 0;\n        int sum = 0;\n        while(j<nums.size()){\n            sum+=nums[j];\n            \n            if(j - i + 1 ==2){\n                if(mp[sum])\n                    return true;\n                \n                mp[sum]++;\n                sum -= nums[i];\n                i++;  \n            }\n            \n            j++;\n                \n        }\n        \n        return false;\n    }\n};\n```\n\n```\n// method -2\nbool findSubarrays(vector<int>& nums) {\n        map<int,int> mp;\n        for(int i=1;i<nums.size();i++){\n            int s=nums[i]+nums[i-1];\n            if(mp.find(s)!=mp.end())\n                return true;\n            mp[s]++;\n        }\n        return false;\n    }\n```
['C', 'Sliding Window']