<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) {
        vector <int> occurrences(128, INT_MAX);
        vector <int> _occurs(128, 0);
        map <char, int> chars;
        for (string & word : words) {
            chars.clear();
            for (char & chr : word) {
                if (chars.find(chr) == chars.end())
                    chars[chr] = 0;
                chars[chr]++;
            }
            for (auto & [chr, occ] : chars) 
                printf("(%c, %d) ", chr, occ);
            printf("\n");
            for (auto & [chr, occ] : chars) {
                occurrences[chr] = std::min(occurrences[chr], occ);
                _occurs[chr]++;
            }
        }
        vector <string> occurs;
        for (int j, i = 0, n = occurrences.size(); i < n; ++i)
            if (occurrences[i] != INT_MAX && _occurs[i] == words.size())
                for (j = 0; j < occurrences[i]; ++j)
                    occurs.push_back(std::string({(char)i, '\0'}));
        return occurs;
    }
};
16100