simple and easy C++ solution
\n# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n###### Let\'s Connect on LinkedIn: www.linkedin.com/in/shishirrsiam\n###### Let\'s Connect on Facebook
\n# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n###### Let\'s Connect on LinkedIn: www.linkedin.com/in/shishirrsiam\n###### Let\'s Connect on Facebook: www.fb.com/shishirrsiam\n\n# Complexity\n- Time complexity: O(n log m)\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```\nclass Solution {\npublic:\n    map<string,int>mp;\n    \n    void stringstreeam(string s)\n    {\n        stringstream ss(s);\n        string word;\n        while(ss>>word) mp[word]++;\n    }\n\n    vector<string> uncommonFromSentences(string s1, string s2) \n    {\n        stringstreeam(s1);\n        stringstreeam(s2);\n\n        vector<string>ans;\n        for(auto x:mp)\n            if(x.second==1) \n                ans.push_back(x.first);\n\n        return ans;\n    }\n};\n```
['Hash Table', 'String', 'Counting', 'C++']