Solution in java
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

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

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

# Code
```java []
class Solution {
    public boolean isPossibleToSplit(int[] nums) {
        HashMap<Integer,Integer> hm = new HashMap<>();
        for(int i = 0; i < nums.length;  i++){
            hm.put(nums[i],hm.getOrDefault(nums[i] , 0 ) + 1);
        }
        for(Integer key : hm.keySet()){
            if(hm.get(key) > 2){
                return false;
            }
        }
        return true;
    }
}
```
['Java']