Python || Sliding window || Bruteforce
Bruteforce \n# Sliding window\n## Time -> O(n)\n## Space -> O(n)\n\n\nclass Solution:\n    def findSubarrays(self, nums: List[int]) -> bool:\n    """ \n\tBrutef
# Bruteforce \n# Sliding window\n## Time -> O(n)\n## Space -> O(n)\n\n```\nclass Solution:\n    def findSubarrays(self, nums: List[int]) -> bool:\n    """ \n\tBruteforce approch\n\t"""\n#         for i in range(len(nums)-2):\n#             summ1 = nums[i] + nums[i+1]\n#             # for j in range(i+1,len(nums)):\n#             for j in range(i+1,len(nums)-1):\n#                 summ = nums[j] + nums[j+1]\n#                 if summ == summ1:\n#                     return True\n#         return False\n\t """\n\t Sliding Window\n\t """\n        one ,two = len(nums)-2,len(nums)-1      // at end of list\n        dic = {}\n        while one >= 0:\n            # print(one,two)\n            summ = nums[one] + nums[two]\n            if summ in dic:\n                return True               // if already there then there is 2 pairs\n            else:\n                dic[summ] = 1        // add summ in of window in dictonary\n            one -=1\n            two -=1\n        return False\n```\n### \uD83D\uDE02 Random Dev Meme\n<img src="https://random-memer.herokuapp.com/" width="512px"/>
['Sliding Window', 'Python', 'Python3']