Python | 99.97% | With comments
Approach:\n --> As there is sub-array of len 2, we use set and store sum by going through first pass only.\n--- > If we encouter same sum then just simply retur
**Approach:**\n --> As there is sub-array of len 2, we use set and store sum by going through first pass only.\n--- > If we encouter same sum then just simply return **True** otherwise by end of that pass return **False**.\n```\nclass Solution:\n    def findSubarrays(self, nums: List[int]) -> bool:\n        sums = set()\n        \n        for i in range(len(nums)-1):\n            t = nums[i]+nums[i+1]\n            if t in sums:\n                return True\n            else:\n                sums.add(t)\n            \n        return False
[]