Easy C++ aproach - frequency
IntuitionWe can only have distinct numbers if their frequency is at most 2, because if it is at least 3, than at least one of the arrays will have at least 2 eq
# Intuition
We can only have distinct numbers if their frequency is at most 2, because if it is at least 3, than at least one of the arrays will have at least 2 equal elements. Therefore, we count the numbers frequency and constantly check if their frequency is at least 3 or not.

# Approach
Create an array in which we save the frequency of each element from the array. After that, check the frequency for every element.

You can also use a hash map instead of an array, but, for me at least, it took more memory than by using an array.

# Complexity
- Time complexity:  ***O(n)***

- Space complexity: ***O(101) ~ O(1)***

# Code
```cpp []
class Solution {
public:
    bool isPossibleToSplit(vector<int>& nums) {
        vector<int> fr(101);

        for (int i = 0; i < nums.size(); ++i) {
            fr[nums[i]]++;
            if(fr[nums[i]] > 2)
                return false;
        }

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