<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 fillna(int count[26],string &s){
    for(char &ch :s){
        count[ch-'a']++;
    }
}

    vector<string> commonChars(vector<string>& words) {
        int count[26]={0};
        fillna(count,words[0]);
        vector<string>v;

        for(int i=1;i<words.size();i++){
            int temp[26]={0};
            fillna(temp,words[i]);

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

        for(int i=0;i<26;i++){
            if(count[i] >0){
                while(count[i]-- >0){
                v.push_back(string(1,i+'a'));
                }
               
            }
        }
        return v;
    }
};
11400