Python Solution 90% Faster
\n\nclass Solution:\n\n    def findSubarrays(self, nums: List[int]) -> bool:\n      z=[]\n      y = deque(nums[:2])\n      z.append(sum(y))\n      j = 2\n      
![image](https://assets.leetcode.com/users/images/fa5e7d31-5e52-4bdf-a99e-77cd127844da_1662224924.937164.png)\n\nclass Solution:\n\n    def findSubarrays(self, nums: List[int]) -> bool:\n      z=[]\n      y = deque(nums[:2])\n      z.append(sum(y))\n      j = 2\n      while j < len(nums):\n        y.popleft()\n        y.append(nums[j])\n        z.append(sum(y))\n        j+=1\n      if len(z)==len(set(z)):\n        return False\n      return True\n
['Sliding Window', 'Python']