Easy way.
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n+m)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n+m)\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    vector<string> uncommonFromSentences(string s1, string s2) {\n        unordered_map<string,int>mp;\n         string word;\n        stringstream ss(s1);\n        while (ss >> word) {\n            mp[word]++;\n        }\n         stringstream ss1(s2);\n        while (ss1 >> word) {\n           mp[word]++;\n        }\n        vector<string>ans;\n        for(auto it:mp)\n        {\n            if(it.second==1)\n            {\n                ans.push_back(it.first);\n            }\n        }\n        return ans;\n    }\n};\n```
['Hash Table', 'String', 'Counting', 'C++']