1
class Solution {
2
 public:
3
  void uncommon(string s, unordered_map<string, int> &mp) {
4
    string word = "";
5
    for (int i = 0; i < s.size(); i++) {
6
      if (s[i] == ' ') {
7
        mp[word]++;
8
        word = "";
9
      } else {
10
        word += s[i];
11
      }
12
    }
13
    mp[word]++;
14
  }
15
  vector<string> uncommonFromSentences(string s1, string s2) {
16
    vector<string> ans;
17
    unordered_map<string, int> mp;
18
    uncommon(s1, mp);
19
    uncommon(s2, mp);
20
    for (pair<string, int> p : mp) {
21
      if (p.second == 1) ans.push_back(p.first);
22
    }
23
    return ans;
24
  }
25
};