<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();
        string temp=words[0];
        vector<string>ans;
      for(char x='a'; x<='z';x++)
      {
        int temp_ans=INT_MAX;
        for(int i=0;i<words.size();i++)
        {
            int temp=0;

            for(int j=0;j<words[i].size();j++)
            {
                if(x==words[i][j])
                temp++;
            }
            temp_ans=min(temp_ans,temp);
        }
        while(temp_ans--)
        {
          
            string y="";
            y+=x;
            ans.push_back(y);
        }
      }
      return ans;
    }
};
11000