Easy hashmap solution
\nclass Solution:\n    def findSubarrays(self, nums: List[int]) -> bool:\n        if len(nums) <= 2:\n            return False\n        seen = set()\n        fo
```\nclass Solution:\n    def findSubarrays(self, nums: List[int]) -> bool:\n        if len(nums) <= 2:\n            return False\n        seen = set()\n        for i in range(len(nums)-2):\n            first = sum(nums[i:i+2])\n            second = sum(nums[i+1:i+3])\n            seen.add(first)\n            if second in seen:\n                return True\n        return False\n\n```
['Ordered Set', 'Python']