✅Beats 100% || JAVA || Beginner Friendly🔥🔥🔥
Complexity\n- Time complexity:\n Add your time complexity here, e.g. O(n) \nO(n)\n- Space complexity:\n Add your space complexity here, e.g. O(n) \nO(n)\n# Code
# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n$$O(n)$$\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(n)$$\n# Code\n```\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        Set<Integer> set = new HashSet<>();\n        for(int i = 0; i < nums.length - 1; i++){\n            int sum = 0;\n            for(int j = i; j < i + 2; j++){\n                sum += nums[j];\n            }\n            if(set.contains(sum)){\n                return true;\n            }else{\n                set.add(sum);\n            }\n        }\n        return false;\n    }\n}\n```
['Array', 'Java']