Easy to understand || C++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        int i;\n        for(i=0;i<nums.size();i++){\n             int n = nums.size();\n        unordered_map<int,int> y;\n        for(int i=1;i<n;i++){\n            int sum = nums[i]+nums[i-1];\n            y[sum]++;\n            if(y[sum]>1) return true;\n        }}\n        return false;\n        \n    }\n};\n```
['Hash Table', 'C++']