Java Solution || HashSet
```java \nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        Set set = new HashSet<>();\n        \n        for(int i=0;i<nums.length-1;i+
```java \nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        Set<Integer> set = new HashSet<>();\n        \n        for(int i=0;i<nums.length-1;i++)\n        {\n            int sum = nums[i]+nums[i+1];\n            int prev=set.size();\n            set.add(sum);\n            if(set.size()==prev)\n                return true;\n        }\n        return false;\n    }\n}
[]