<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:
    vector<string> commonChars(vector<string>& words) {
        map<char,int> f1;
        for(int i=0;i<words[0].length();i++)
        {
            f1[words[0][i]]++;
        }
        for(int i=1;i<words.size();i++)
        {
            map<char,int> temp;
            for(int j=0;j<words[i].length();j++)
            {
                temp[words[i][j]]++;
            }
            for(auto &it:f1)
            {
                it.second=min(it.second,temp[it.first]);
            }
        }
        vector<string> res;
        for(auto &it:f1)
        {
            if(it.second!=0)
            {
                for(int i=0;i<it.second;i++) {
                    string s1;
                    s1+=it.first;
                    res.push_back(s1);
                }
            }
        }
        return res;
    }
};
15900