Optimized simple solution - beats  93.51%🔥
Complexity
Time complexity: O(N)

Space complexity: O(1)
Code
# Complexity
- Time complexity: O(N)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity: O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public boolean isPossibleToSplit(int[] nums) {
        int[] t = new int[101];
        
        for (int i : nums) {
            t[i]++;
            if (t[i] > 2) return false;
        }

        return true;
    }
}
```
['Java']