C++ Easy Solution [0ms faster than 100%, 8.6 MB less than 100%]
Runtime: 0 ms, faster than 100.00% of C++ online submissions for Uncommon Words from Two Sentences.\nMemory Usage: 8.6 MB, less than 100.00% of C++ online submi
Runtime: 0 ms, faster than 100.00% of C++ online submissions for Uncommon Words from Two Sentences.\nMemory Usage: 8.6 MB, less than 100.00% of C++ online submissions for Uncommon Words from Two Sentences.\n\n```\nvector<string> uncommonFromSentences(string A, string B) {\n        \n        vector<string> res;\n        unordered_map<string, int> mp;\n        \n        string word = "";\n        for(char ch : A)\n        {\n            if(ch == \' \')\n            {\n                mp[word]++;\n                word = "";\n            }\n            else\n                word += ch;\n        }\n        \n        mp[word]++;\n        word = "";\n        \n        for(char ch : B)\n        {\n            if(ch == \' \')\n            {\n                mp[word]++;\n                word = "";\n            }\n            else\n                word += ch;\n        }\n        \n        mp[word]++;\n        \n        for(auto i : mp)\n            if(i.second == 1) res.push_back(i.first);\n        \n        return res;\n    }
['String', 'C', 'C++']