C++ beginners friendly solution
IntuitionApproachfirst sort the array
just comparing the occurence of elemnts if it is 3 times than it should return falseComplexity
Time complexity:

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

# Approach
<!-- Describe your approach to solving the problem. -->
first sort the array
just comparing the occurence of elemnts if it is 3 times than it should return false

# 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) {
        int n=nums.size();
        sort(nums.begin(),nums.end());
        for(int i=0;i<n-2;i++){
            if(nums[i]==nums[i+1] && nums[i]==nums[i+2]) return false;

        }
        return true;
    }
};
```
['C++']