Python | 99% Faster |  Easy Solution✅
\ndef findSubarrays(self, nums: List[int]) -> bool:\n        seen = set()\n        for i in range(len(nums)-1):\n            s = nums[i] + nums[i+1]\n          
```\ndef findSubarrays(self, nums: List[int]) -> bool:\n        seen = set()\n        for i in range(len(nums)-1):\n            s = nums[i] + nums[i+1]\n            if s in seen:\n                return True\n            seen.add(s)\n        return False\n```\n![image](https://assets.leetcode.com/users/images/78187650-64db-4b93-932e-154312c9e1f0_1662554404.896161.png)\n
['Python', 'Python3']