Solution using hashmap 100% beat
\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# 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```python3 []\nclass Solution:\n    def isPossibleToSplit(self, nums: List[int]) -> bool:\n        if len(nums)%2!=0:\n            return False\n        d={}\n        for i in nums:\n            if i in d:\n                d[i]+=1\n            else:\n                d[i]=1\n        for i,j in d.items():\n            if j>2:\n                return False\n        return True\n            \n```
['Array', 'Hash Table', 'Counting', 'Python3']