JAVA || HASHSET
\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        if(nums.length == 2){\n            return false;\n        }\n        \n        int s
```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        if(nums.length == 2){\n            return false;\n        }\n        \n        int sum = 0;\n        HashSet<Integer> set = new HashSet<>();\n        \n        int end =0, start =0;\n        while(end < nums.length){\n            sum+= nums[end];\n            if(end - start +1 < 2){\n                end++;\n            }\n            else if(end - start +1 == 2){\n                if(set.contains(sum)){\n                    return true;\n                }\n                else{\n                    set.add(sum);\n                }\n                sum -= nums[start];\n                start++;\n                end++;\n            }\n        }\n        return false;\n    }\n}\n```
['Java']