Easy to understand solution in Java. Beats 93.14 %
Complexity

Time complexity:
O(n)


Space complexity:
O(n)

Code
# Complexity
- Time complexity:
O(n)

- Space complexity:
O(n)

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