Find Subarrays With Equal Sum Solution in 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)$$ -->\nO(n^2)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        int i, j;\n        for(i=0 ; i<nums.size()-2 ; i++)\n        { \n            for(j=i+1 ; j<nums.size()-1 ; j++)\n            {\n                if((nums[i]+nums[i+1])==(nums[j]+nums[j+1]))\n                    return true;\n            }\n        }\n        return false;\n    }\n};\n```\n![upvote new.jpg](https://assets.leetcode.com/users/images/792a2ee3-fa92-4936-9a87-216cd9a9ac02_1682613207.1269994.jpeg)
['C++']