Simple HashSet [JAVA]
If you like the solution pls upvote\n\n\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        Set<Integer> set = new HashSet<>();\n        
If you like the solution pls upvote\n\n```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        Set<Integer> set = new HashSet<>();\n        \n        for(int i = 1; i < nums.length; i++){\n            if(!set.add(nums[i] + nums[i-1]))\n                return true;\n        }\n\n\n        return false;\n    }\n}\n```
['Java']