easy to understand
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public boolean findSubarrays(int[] nums) {
        int n = nums.length;
        int count = 0;
        for(int i=0; i<n-1; i++) {
            for(int j=i+1; j<n-1; j++) {
                if(nums[j] + nums[j+1] == nums[i]+nums[i+1])
                    count++;
            }
        }
        return count >= 1;
    }
}
```
['Java']