if(looking for easy solution){1ms , 99% beats solution is  here for you}else{continue;}
follow me on instagram : @ku_.k_kuApproachComplexity
Time complexity:

Space complexity:
Code
follow me on instagram : @ku_.k_ku
# 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
```javascript []
/**
 * @param {number[]} nums
 * @return {boolean}
 */
var isPossibleToSplit = function(nums) {
    nums.sort((a,b)=>a-b)
    for(let i=0;i<nums.length;i++){
        if((nums.lastIndexOf(nums[i])-i)>=2){
            return false
        }
    }
    return true
};
```
['JavaScript']