<p>Given a string array <code>words</code>, return <em>an array of all characters that show up in all strings within the </em><code>words</code><em> (including duplicates)</em>. You may return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> words = ["bella","label","roller"]
<strong>Output:</strong> ["e","l","l"]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> words = ["cool","lock","cook"]
<strong>Output:</strong> ["c","o"]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>words[i]</code> consists of lowercase English letters.</li>
</ul>

class Solution {
public:
string common(string a,string b)
{
    string ans;
    unordered_map<char,int> mp;
    for(auto x:a) mp[x]++;
    for(auto x:b)
    {
         if(mp.find(x) !=mp.end())//mil gyooo !!
         {
            mp[x]--;
            if(mp[x]==0) mp.erase(x);
            ans.push_back(x);
         }
    }
    return ans;
}
    vector<string> commonChars(vector<string>& words) 
    {
        int n=words.size();
        string ans=words[0];
        unordered_map<char,int> mp;
        for(int i=0;i<n;i++)
        {
            ans=common(ans,words[i]);
        }
        cout<<ans;
        vector<string> mahi;
        for(auto x:ans) mahi.push_back(string(1,x));
        return mahi;
    }
};
14900