CPP || best solution in the world
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        s1 += \' \' + s2 + \' \';\n        map<string,int>m;\n        vector<string>v;\n        string str = "";\n        for(char ch: s1){\n            if(ch == \' \'){\n                if(!str.empty()) {\n                    m[str]++;\n                    str = "";\n                }\n            }\n            else{\n                str +=ch;\n            }\n        }\n        for(auto i:m){\n            if(i.second==1){\n                v.push_back(i.first);\n            }\n        }\n        return v;\n    }\n};\n```
['C++']