✅C++ || 2 Methods (MAP & Loop) ||✅Easily Understandable || Commented
\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) \n    {\n        // First method\n        map<int,int> mp;                               
```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) \n    {\n        // First method\n        map<int,int> mp;                                                       // create a map for storing all pair sum ans their occurance \n        int n = nums.size();\n        for(int i=0;i<n-1;i++)\n        {\n            mp[nums[i]+nums[i+1]]++;                                           // each time incease the occurance of pair sum\n        }\n        \n        for(auto it : mp)                                                      // iterate over the map\n        {\n            if(it.second>1) return true;                                       // any point we get any pair sum occurance more than 1 just return true\n        }\n        return false;\n    }  \n};\n```\n\n```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) \n    {\n        \n        // second method\n        for(int i=1;i<nums.size();i++)                                         // from 0 to n-1\n        {\n            int sum = nums[i-1]+nums[i];                                       // storing the current pair sum\n            for(int j=i;j<nums.size()-1;j++)                                   // from i to n-1\n            {\n                if(nums[j]+nums[j+1]==sum) return true;                        // any point of time we get same pair of sum return true \n            }\n        }\n        return false;\n    }  \n};\n```
[]