With Explanation Comments: Time: 20 ms (100.00%), Space: 7.3 MB (100.00%)
Like it? ->Upvote please! \u30C4\n\n\'\'\'\nclass Solution {\npublic:\n    bool findSubarrays(vector& nums) {\n        \n        //loop over the whole array ele
**Like it? ->Upvote please!** \u30C4\n\n\'\'\'\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        \n        //loop over the whole array elements as a first pointer\n        for(int i=0;i<nums.size()-1;i++){\n            \n        //loop over the remainder array elements as a second pointer\n            for(int j=i+1;j<nums.size()-1;j++){\n                //check if the current + the next digit values of the first pointer equals to the current + the next digit values of the second pointer\n                if(nums[i]+nums[i+1]==nums[j]+nums[j+1])\n                //if yes-> true\n                    return true;\n            }\n        }\n        \n        //if no-> false\n        return false;\n    }\n};\n\'\'\'\n\n**Like it? ->Upvote please!** \u30C4\n**If still not understood, feel free to comment. I will help you out**\n**Happy Coding :)**
['Array', 'C', 'C++']