0ms sliding window and map approach
\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        int count=0;\n        int wsum=0;\n        HashMap<Integer,Integer> hm = new HashMap
```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        int count=0;\n        int wsum=0;\n        HashMap<Integer,Integer> hm = new HashMap<>();\n        int ws=0;\n        for(int we=0;we<nums.length;we++){\n            wsum+=nums[we];\n            while(we-ws+1 >= 2){\n                if((we-ws+1==2) && (hm.containsKey(wsum))) return true;\n                hm.put(wsum,1);\n                wsum-=nums[ws];\n                ws++;\n            }\n        }\n        return false;\n    }\n}\n```
['Java']