Easy Java Solution || HashMap
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 isPossibleToSplit(int[] arr) {\n        HashMap<Integer,Integer> hp = new HashMap<>();\n        int n = arr.length;\n        \n        for(int i=0; i<n; i++){\n            hp.put(arr[i],hp.getOrDefault(arr[i],0)+1);\n        }\n        \n        \n        for(var a : hp.values()){\n            if(a>2) return false;\n        }\n        return true;\n    }\n}\n```
['Java']