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

void fillCount(string& word , int count[26]){
     for(char &ch : word ){
        count[ch - 'a']++;
     }
}
    vector<string> commonChars(vector<string>& words) {
       vector<string> res;
        int n = words.size();

        int count[26]= {0};

       fillCount(words[0],count);

       for(int i=1;i<n;i++){
            int temp[26]={0};
            fillCount(words[i],temp);


            for(int j=0;j<26;j++){
                count[j]= min(count[j], temp[j]);
            }
       }

       for(int i=0;i<26;i++){
            int c = count[i];

            while(c--){
                res.push_back(string(1, i+'a'));
            }
       }

       return res;
    }


};
11000