Easy || Java || Super Fast || Set || Concise
\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        HashSet<Integer> set = new HashSet<Integer>();\n        int n = nums.length,i;\n    
```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        HashSet<Integer> set = new HashSet<Integer>();\n        int n = nums.length,i;\n        for(i=1;i<n;i++){\n            if(set.contains(nums[i-1]+nums[i])) return true;\n            set.add(nums[i-1]+nums[i]);\n        }\n        return false;\n    }\n}\n```
['Ordered Set', 'Java']