Optimum solution using python easy to understand.
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def findSubarrays(self, nums: List[int]) -> bool:\n        dict1={}\n        for i in range(len(nums)-1):\n            x=sum(nums[i:i+2])\n            if x in dict1:\n                return True\n            else:\n                dict1[x]=x \n        return False\n\n\n```
['Python3']