Solution which is done in 100 beats
IntuitionApproachComplexity

Time complexity:
O(n)


Space complexity:
O(n)

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

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

# Complexity
- Time complexity:
O(n)

- Space complexity:
O(n)

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