JAVA| Hash Set | Easy Understanding
class Solution {\n    public boolean findSubarrays(int[] nums) {\n        if(nums.length<=2){\n            return false;\n        }\n        HashSet set = new H
# class Solution {\n    public boolean findSubarrays(int[] nums) {\n        if(nums.length<=2){\n            return false;\n        }\n        HashSet<Integer> set = new HashSet<>();\n        for(int i=0; i<nums.length-1; i++){\n            int sum = nums[i]+nums[i+1];\n            if(set.contains(sum)) return true;\n            set.add(sum);\n        }\n    \n        return false;\n    }\n}\n\n
['Java']