SPLIT THE ARRAY.
IntuitionAS IT WWAS CLEAR FROM THE QUESTION THAT ELEMENTS SHOULD BE DISTINCT , SO THE COUNT OF THE ELEMENT CANT EXCEED 2 RIGHT , AND THE LENGTH OF THE ARRAY SHO
# Intuition
AS IT WWAS CLEAR FROM THE QUESTION THAT ELEMENTS SHOULD BE DISTINCT , SO THE COUNT OF THE ELEMENT CANT EXCEED 2 RIGHT , AND THE LENGTH OF THE ARRAY SHOULD BE EVEN ALSO .
<!-- Describe your first thoughts on how to solve this problem. -->

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

# Complexity
- Time complexity:
- O(2n), 
- O(n)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

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

# Code
```cpp []
class Solution {
public:
    bool isPossibleToSplit(vector<int>& nums) {
        // you have to check the count of every number and if count of each each is <=2; and total numbers total count sum 
        int n=nums.size();
        map<int,int> mpp;
        if(n%2==0){
            for(int i:nums){
                mpp[i]++;
            }
        }
        bool flag=false;
        for(auto it:mpp){
            if(it.second<=2){
               flag=true;
            }
            else{
                return false;
            }
        }
        return flag;
    }
};
```
['Array', 'Hash Table', 'C++']