✅C++ || SHORT && CLEAN && EASY || Bruteforce
\n\n\tclass Solution {\n\tpublic:\n\t\tbool findSubarrays(vector& nums) {\n\t\t\tint n=nums.size();\n\t\t\tint count=0;\n\t\t\tfor(int i=0;i<n-1;i++){\n\t\t\t\t
![image](https://assets.leetcode.com/users/images/f079ef63-3f7f-4a89-b5ff-e07add6282df_1662221429.1087756.png)\n\n\tclass Solution {\n\tpublic:\n\t\tbool findSubarrays(vector<int>& nums) {\n\t\t\tint n=nums.size();\n\t\t\tint count=0;\n\t\t\tfor(int i=0;i<n-1;i++){\n\t\t\t\tfor(int j=i+1;j<n-1;j++){\n\t\t\t\t\tif(nums[j]+nums[j+1]==nums[i]+nums[i+1]) count++;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn count>=1;\n\t\t}\n\t};
['C', 'C++']