My accepted java solution in 0 Ms
```\n\tSet s = new HashSet<>();\n    public boolean findSubarrays(int[] nums) {\n        for(int i=0;i<nums.length-1;i++){\n            int x = nums[i]+nums[i+1
```\n\tSet<Integer> s = new HashSet<>();\n    public boolean findSubarrays(int[] nums) {\n        for(int i=0;i<nums.length-1;i++){\n            int x = nums[i]+nums[i+1];\n            if(s.contains(x)){return true;}\n            else{s.add(x);}\n        }\n        return false;\n    }
[]