Java Solution Map
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: 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\n# Code\n```\nclass Solution {\n    public boolean isPossibleToSplit(int[] nums) {\n       Map<Integer,Integer> map = new HashMap<>();\n        int n = nums.length;\n        for(int i =0;i < n;i++){\n            map.put(nums[i],map.getOrDefault(nums[i],0)+1);\n        }\n        \n         for (int freq : map.values()) {\n           if(freq > 2)return false;\n        }\n        \n        \n        return true;\n    }\n}\n```
['Java']