[Java] Faster than 100%, 6 Lines
set.add(x) returns true when set does not contain x and hence adds x successfully.\nSimilarly set.add(x) returns false when set contains x.\n\nclass Solution {\
`set.add(x)` returns true when `set` does not contain `x` and hence adds `x` successfully.\nSimilarly `set.add(x)` returns false when `set` contains `x`.\n```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        Set<Integer> set = new HashSet<>();\n        for (int i = 1; i < nums.length - 1; i += 2) {\n            int first = nums[i - 1] + nums[i], second = nums[i] + nums[i + 1];\n            if (!set.add(first) || !set.add(second)) return true;\n        }\n        return false;\n    }\n}\n```
[]