JAVA solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        if(nums.length<3)return false;\n        HashSet<Integer> set = new HashSet<>();\n        for(int i=0;i<nums.length-1;i++){\n            if(set.contains(nums[i]+nums[i+1])){\n                return true;\n            }\n            else{\n                set.add(nums[i]+nums[i+1]);\n            }\n        }\n        return false;\n    }\n}\n```
['Java']