hash map 
Intuitionso instead of sitting down and thinking about how do i solve this problem i used the hashmap data sructure.ApproachEasy approach is that u get the elem
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
so instead of sitting down and thinking about how do i solve this problem i used the hashmap data sructure.
# Approach
<!-- Describe your approach to solving the problem. -->
Easy approach is that u get the elements and occurences of them and save it to one object. while adding them i checked if the one elements occurences greater than two then return false. WHY? beauce if one number has occurences of 3 it cannot be unique when we split the array.

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

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

# Code
```javascript []
/**
 * @param {number[]} nums
 * @return {boolean}
 */

var isPossibleToSplit = function(nums) {
    let obj = {}
    for(let i in nums ){
            if(obj[nums[i]]){
                obj[nums[i]] += 1;
            } else {
                obj[nums[i]] = 1;
            }
            if(obj[nums[i]] > 2){
                return false
            }
    }

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