<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) {
        unordered_map<char,int>map;
        for(char c:words[0]){
            map[c]++;
        }
        vector<string>ans;
        unordered_map<char,int>tmap;
        for(int i=1;i<words.size();i++){
            for(char c:words[i]){
                tmap[c]++;
            }
            for(auto&[k,num]:map){
                if(tmap[k]<num){
                    num=tmap[k];
                }
            }
            tmap.clear();
        }
        for(auto&[k,num]:map){
            while(num!=0){
                ans.push_back(string(1,k));
                num--;
            }    
        }
        return ans;
    }
};
13500