Easy-Peasy C++ Solution 🙌🙌
Code\n\nclass Solution {\npublic:\n    bool isPossibleToSplit(vector<int>& nums) {\n        unordered_map<int, int> hash;\n        for (int i = 0; i < nums.size
# Code\n```\nclass Solution {\npublic:\n    bool isPossibleToSplit(vector<int>& nums) {\n        unordered_map<int, int> hash;\n        for (int i = 0; i < nums.size(); i++) {\n            hash[nums[i]]++;\n            if (hash[nums[i]] > 2) return false;\n        }\n        return true;\n    }\n};\n```
['Math', 'Counting', 'Iterator', 'Hash Function', 'C++']