<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> count(26,0);
        vector<int> ans(26,0);
        for(auto i:words[0])
        {
            count[i-'a']++;
            ans[i-'a']++;
        }
        for(auto i:words)
        {
            vector<int> temp(26,0);
            for(auto j:i)
            {
                temp[j-'a']++;
            }
            for(int x=0;x<26;x++)
            {
                ans[x]=min(ans[x],temp[x]);
            }
        }
        for(auto i:ans)
        {
            cout<<i<<" ";
        }
        vector<string> fin;
        for(int i=0;i<26;i++)
        {
            for(int j=0;j<ans[i];j++)
            {
                char temp='a'+i;
                string str="";
                str+=temp;
                fin.push_back(str);
            }
        }
        return fin;
    }
};
12300