JAVA | HashMap
\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        int sum = 0;\n        HashMap<Integer,Integer> map = new HashMap<>();\n        int n
```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        int sum = 0;\n        HashMap<Integer,Integer> map = new HashMap<>();\n        int n = nums.length;\n        int j = 1;\n        for(int i = 0; i < n-1; i++) {\n            sum = nums[i] + nums[j];\n            map.put(sum,map.getOrDefault(sum,0)+1);\n            j++;\n        }\n        int count = 0;\n        for(int num: map.values()) {\n            if(num > 1) {\n                count++;\n            }\n        }\n        if(count >= 1) {\n            return true;\n        }\n        return false;\n    }\n}\n```
[]