<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>

#include <bits/stdc++.h>


using namespace std;
class Solution {
public:
vector<string> commonChars(vector<string>& words) {
    vector<string> fo;
    unordered_map<char, int> fd;
    unordered_map<char, int> d;
    for (char c : words[0]) {
        if (fd.find(c) == fd.end()) {
            fd[c] = 1;
        }
        else {
            fd[c]++;
        }
    }

    for (string word : words) {
        d.clear();
        for(char c:word) {
            if (d.find(c) == d.end()) {
                d[c] = 1;
            }
            else {d[c]++;}
        }
        for(const auto& pair:fd) {
            if (d.find(pair.first) == d.end()) {
                fd[pair.first] = 0;
            }
        }

        for(const auto& pair:fd){
            if(d[pair.first]<fd[pair.first]){
                fd[pair.first]=d[pair.first];
            }
        }
    }
    for(const auto& pair:fd){
        for(int i = 0; i<pair.second; i++){
            fo.push_back(string(1, pair.first));
        }
    }


return fo;


}};
14200