☑️✅Easy JAVA Solution || Beats 100%✅☑️
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
# 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```\nclass Solution {\n    public boolean isPossibleToSplit(int[] nums) {\n        int n=nums.length;\n        HashMap<Integer,Integer>map=new HashMap<>();\n        int count=0;\n        for(int i=0;i<n;i++){\n            map.put(nums[i],map.getOrDefault(nums[i],0)+1);\n        }\n        for(int it:map.values()){\n            if(it>2)return false;\n        }\n        return true;\n    }\n}```
['Java']