best approach
IntuitionApproachComplexity
Time complexity:
o(n)
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)$$ -->
o(n)

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

# Code
```cpp []
class Solution {
public:
    bool isPossibleToSplit(vector<int>& nums) {
        int data[1000]={0};
        int n=nums.size();
        for(int i=0;i<n;i++){
            data[nums[i]]++;
            if(data[nums[i]]>2){
                return false;
            }
        }
        return true;
    }
};
```
['C++']