<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<string, int> m;
        unordered_map<char, int> s;
        vector<string>ans;
        for (auto word : words) {
            for (int i = 0; i < 26; ++i) {
                s[i + 97] = 0;
            }

            for (char alpha : word) {
                m[alpha + to_string(s[alpha])]++;
                s[alpha]++;
            }
        }

        for (auto it : m) {
            if(it.second == words.size()){
                ans.push_back(string(1, it.first[0]));
            }
        }
        return ans;
    }
};
15500