Using Hash map
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
```cpp []
class Solution {
public:
    bool isPossibleToSplit(vector<int>& nums) {
        unordered_map<int,int>count;
        int maxf=0;
        for(int i=0;i<nums.size();i++){
            count[nums[i]]++;
            maxf=max(maxf,count[nums[i]]);
        }
        if(maxf>2){
            return false;
        }else{
            return true;
        }
    }
};
```
['C++']