Python 3 || 1 line,  Counter || T/S: 84% / 72%
\nclass Solution:\n    def isPossibleToSplit(self, nums: List[int]) -> bool:\n  \n        return max(set(Counter(nums).values())) <= 2\n\nhttps://leetcode.com/p
```\nclass Solution:\n    def isPossibleToSplit(self, nums: List[int]) -> bool:\n  \n        return max(set(Counter(nums).values())) <= 2\n```\n[https://leetcode.com/problems/split-the-array/submissions/1185447945/](https://leetcode.com/problems/split-the-array/submissions/1185447945/)\n\n\nI could be wrong, but I think that time complexity is *O*(*N*) and space complexity is *O*(*N*), in which *N* ~ `len(nums)`.
['Python3']