Easy solution in cpp !! Beats 92% user runtime !!!
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool isPossibleToSplit(vector<int>& nums) {\n        int n = nums.size();\n        if(n%2!=0) return false;\n\n        unordered_map<int,int> freq;\n        for(int num : nums){\n            freq[num]++;\n            if(freq[num]>2){\n                return false;\n            }          \n        }\n        \n        return true;\n    }\n};\n```
['C++']