[Java] Simple HashSet solution
\nimport java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        Set<Integer> set = new HashSet<>
```\nimport java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        Set<Integer> set = new HashSet<>();\n        \n        for (int i = 1; i < nums.length; i++) {\n            int cur = nums[i - 1] + nums[i];\n            \n            if (!set.add(cur)) {\n                return true;\n            }\n        }\n        \n        return false;\n    }\n}\n```
['Java']