Easy Solution
Complexity\n- Time complexity:O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:O(n)\n Add your space complexity here, e.g. O(n) \n\n# Code
# Complexity\n- Time complexity:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    vector<string> uncommonFromSentences(string s1, string s2) {\n        vector<string> ans;\n        unordered_map<string, int> mp;\n        string str = s1 + " " + s2 + " ";\n        string a = "";\n        int i = 0;\n\n        while(i<str.length()){\n            if(str[i] != \' \'){\n                a += str[i];\n            }\n            else if(str[i] == \' \' || i==str.length()-1){\n                mp[a]++;\n                a = "";\n            }\n            i++;\n        }\n\n        for(auto it:mp){\n            if(it.second == 1){\n                ans.push_back(it.first);\n            }\n        }\n        return ans;\n    }\n};\n```
['Hash Table', 'String', 'Counting', 'C++']