JAVA | HashSet Method
\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        HashSet<Long> set = new HashSet<>();\n        for(int i=0; i<nums.length-1; i++) {\n
```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        HashSet<Long> set = new HashSet<>();\n        for(int i=0; i<nums.length-1; i++) {\n            long sum = (long) (nums[i]+nums[i+1]);\n            if(set.contains(sum)) return true;\n            set.add(sum);\n        }\n        \n        return false;\n    }\n}\n```
[]