<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:
    int arr[100][26];
    vector<string> commonChars(vector<string>& words) {
        for(int i = 0 ; i<words.size(); ++i) {
            for(auto c : words[i])
            arr[i][c-'a']++;
        }
        vector<string>ans;
        for(int i = 0 ; i<26 ; ++i) {
            int mini = 1e9;
            for(int j = 0 ; j<words.size(); ++j) {
                mini = min(mini , arr[j][i]);
            }
            char c = 'a' + i;
                string s = "";
                s += c;
            while(mini--) {
                ans.push_back(s);
            }
        }
        return ans;
    }
};
11600