<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) 
    {
        int sze = words.size();
        map <char,int> mci[sze];
        int i = 0;
        for(auto ech:words)
        {
            for(auto chr:ech)
            {
                mci[i][chr]++;
            }
            i++;
        }
        vector <string> v;
        int mx = INT_MAX;
        set <char> s;
        for(int i=0;i<words[0].size();i++)
        {
            s.insert(words[0][i]);
        }

        for(auto ech:s)
        {
            mx = INT_MAX;
            for(int i=0;i<sze;i++)
            {
                if(mci[i].count(ech) == 1)
                {
                    mx = min(mx, mci[i][ech]);
                }
                else
                {
                    mx = 0;
                }
            }
            for(int i=0;i<mx;i++)
            {
                string tmp;
                tmp += ech;
                v.push_back(tmp);
            }
        }
        return v;
    }
};
16200