Java 0ms beats 100%
Complexity\n- Time complexity:O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:O(n)\n Add your space complexity here, e.g. O(n) \n\n# Code
# Complexity\n- Time complexity:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n      int n=nums.length;\n      Set<Integer> set=new HashSet<>();\n      for(int i=0;i<n-1;i++){\n        int sum=nums[i]+nums[i+1];\n        if(!set.add(sum)) return true;\n      }\n      return false;\n    }\n}\n```
['Hash Table', 'Java']