0ms 100% beat in java very easiest code 😊.
Code
![94da60ee-7268-414c-b977-2403d3530840_1725903127.9303432.png](https://assets.leetcode.com/users/images/aeca8748-ccd4-44e2-b896-4edc7966b792_1735796482.2268233.png)


# Code
```java []
class Solution {
    public boolean isPossibleToSplit(int[] nums) {
        int[] numbers = new int[101];

        // for (int i: nums) {   It is also valid .
        //    if (++numbers[i] > 2) return false; 
        //  }

        for (int i: nums) { 
            if (numbers[i]++ >= 2) 
                return false; 
        }

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