Simple HashMap Solution Java(100%)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n1. put nums[i]+nums[i+1
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n1. put nums[i]+nums[i+1] in the freqmap if it is repeated return true\n2. else at the end return false\n# Complexity\n- Time complexity:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public boolean findSubarrays(int[] nums) {\n        int n=nums.length;\n        Map<Integer, Integer> freq = new HashMap<>();\n        for(int i=0;i<n-1;i++){\n            if (freq.containsKey(nums[i]+nums[i+1])) {\n                return true;\n            }\n            freq.put(nums[i]+nums[i+1], 1);\n        }\n        return false;\n    }\n}\n```
['Java']