100% Beat C++ solution Best Solution
100% Beats \n\nclass Solution {\npublic:\n    vector<string> uncommonFromSentences(string s1, string s2) {\n        string full = s1 + " " + s2;\n        vector
**100% Beats **\n```\nclass Solution {\npublic:\n    vector<string> uncommonFromSentences(string s1, string s2) {\n        string full = s1 + " " + s2;\n        vector<string> ans;  \n        unordered_map<string, int> wordCount;\n\n        int currentStart = 0;\n        for (int i = 0; i <= full.size(); i++) {\n            if (i == full.size() || full[i] == \' \') {\n                if (i > currentStart) { \n                    string word = full.substr(currentStart, i - currentStart);\n                    wordCount[word]++;\n                }\n                currentStart = i + 1;\n            }\n        }\n\n        for(const auto& word : wordCount){\n            if(word.second == 1){\n                ans.push_back(word.first);\n            }\n        }\n        return ans;\n    }\n};\n\n```
['C']