<p>A <strong>sentence</strong> is a string of single-space separated words where each word consists only of lowercase letters.</p>

<p>A word is <strong>uncommon</strong> if it appears exactly once in one of the sentences, and <strong>does not appear</strong> in the other sentence.</p>

<p>Given two <strong>sentences</strong> <code>s1</code> and <code>s2</code>, return <em>a list of all the <strong>uncommon words</strong></em>. You may return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s1 = &quot;this apple is sweet&quot;, s2 = &quot;this apple is sour&quot;</span></p>

<p><strong>Output:</strong> <span class="example-io">[&quot;sweet&quot;,&quot;sour&quot;]</span></p>

<p><strong>Explanation:</strong></p>

<p>The word <code>&quot;sweet&quot;</code> appears only in <code>s1</code>, while the word <code>&quot;sour&quot;</code> appears only in <code>s2</code>.</p>
</div>

<p><strong class="example">Example 2:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s1 = &quot;apple apple&quot;, s2 = &quot;banana&quot;</span></p>

<p><strong>Output:</strong> <span class="example-io">[&quot;banana&quot;]</span></p>
</div>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s1.length, s2.length &lt;= 200</code></li>
	<li><code>s1</code> and <code>s2</code> consist of lowercase English letters and spaces.</li>
	<li><code>s1</code> and <code>s2</code> do not have leading or trailing spaces.</li>
	<li>All the words in <code>s1</code> and <code>s2</code> are separated by a single space.</li>
</ul>

class Solution {
public:
    
    vector<string> get_vec(string s)
    {
        string p ="";

        vector<string> ans;

        for(int i = 0; i<s.size(); i++)
        {

            if(s[i]==' ')
            {
                ans.push_back(p);
                p="";
               
            }
            else
            {
                p+=s[i];
            }
        }
        ans.push_back(p);

        return ans;
    }
 
    vector<string> uncommonFromSentences(string s1, string s2) {

        vector<string> a,b;

        a= get_vec(s1);
        b = get_vec(s2);

        map<string,int> mp;

        vector<string> res;

        

        set<string> s;

        for(int i =0; i<a.size(); i++)
        {
            mp[a[i]]++;
        }

        
        for(int i =0; i<b.size(); i++)
        {
           mp[b[i]]++;
        }

       for(auto i : mp)
       {
        if(i.second==1)
        {
            res.push_back(i.first);
        }
       }

        return res;

        
    }
};
9200