Java Easy-Peasy solution for Beginners,Best for Logic Building
Follow Brute Force Methods for Initial Logic Building...will take you places\n\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n       for(int
Follow Brute Force Methods for Initial Logic Building...will take you places\n```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n       for(int i=0;i<nums.length-1;i++)\n           for(int j=i+1;j<nums.length-1;j++)\n               if((nums[i]+nums[i+1])==(nums[j]+nums[j+1]))\n                   return true;\n        return false;\n    }\n}\n```\nPlease Upvote if you find this Helpful...**Happy Coding...**
['Java']