C++ Simple and Short, Using Hashmap, 0 ms Beats 100%
Code\ncpp []\nclass Solution {\npublic:\n    bool isPossibleToSplit(vector<int>& nums) {\n        unordered_map<int, int> freq;\n        for (auto n : nums) {\n
# Code\n```cpp []\nclass Solution {\npublic:\n    bool isPossibleToSplit(vector<int>& nums) {\n        unordered_map<int, int> freq;\n        for (auto n : nums) {\n            if (freq[n] == 2) return false;\n            freq[n]++;\n        }\n        return true;\n    }\n};\n```
['C++']