more than 2 times occurence
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```\nimport java.util.HashMap;\n\nclass Solution {\n    public boolean isPossibleToSplit(int[] nums) {\n        HashMap<Integer,Integer> mp=new HashMap<>();\n        for(int it:nums){\n            mp.put(it, mp.getOrDefault(it, 0) + 1);\n        }\n        for(int i=0;i<nums.length;i++){\n            if(mp.get(nums[i])>2) return false;\n        }\n        return true;\n    }\n}\n\n```
['Java']