✔ [JAVA] | HashSet
\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        \n        if(nums.length<2)\n        return false;\n        \n        HashSet<Intege
```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        \n        if(nums.length<2)\n        return false;\n        \n        HashSet<Integer> set=new HashSet<>(); //  To Track previous sum calculated \n        \n        for(int i=0;i<nums.length-1;i++){\n            \n            if(!set.add(nums[i]+nums[i+1]))  //   Check if sum already exist \n            return true;\n            \n        }\n        \n        return false;    \n        \n    }\n}\n\n```
['Java']