<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 n = words.size();
        vector<vector<int>> arr;

        for (int i=0;i<n;i++) {
            vector<int> a(26);
            arr.push_back(a);
        }


        for (int i=0;i<n;i++) {
            string s = words[i];
            for (int j = 0;j<words[i].size();j++) {
                arr[i][s[j]-'a']++;
            }
        }


        vector<string> ans;
        for (int i=0;i<26;i++) {
            int minfreq = INT_MAX;
            string x;
            x += 'a'+i;
            for (int j = 0;j<n;j++) {
                cout << arr[j][i] << " ";
                minfreq = min(minfreq,arr[j][i]);
                if (minfreq == 0) {
                    
                    break;
                }
            }
            cout << endl;

            if (minfreq!=0) {
                while (minfreq) {
                    ans.push_back(x);
                    minfreq--;
                }
            }
        }


        return ans;


    }
};
13200