<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:
    string commonInWord(string ans, string word){
        string res;
        unordered_map<char,int> mp;
        for(char ch: ans){
            mp[ch]++;
        }

        for(char ch: word){
            if(mp.find(ch) != mp.end()){
                mp[ch]--;
                if(mp[ch]==0) mp.erase(ch);
                res.push_back(ch);
            }
        }
        return res;
    }
      
        // int i=0, j=0;
        // if(k == words.length){
        //     return
        // }
        // while(i<words[k].size()){
        //     if(words[k][i]== words[k+1][j]){
        //         common.push_back(words[0][i]);
        //         words[1].replace(j,.);
        //         i++;
        //         j=0;
                
        //     }
        //     else{
        //         j++;
        //     }

        // }
        
    
    vector<string> commonChars(vector<string>& words) {
        int n = words.size();
        string ans = words[0];
        vector<string> common;
        
        for(int i=1; i<n; i++){
            ans= commonInWord(ans, words[i]);
        }

        for(char ch : ans){
            common.push_back(string(1,ch));
        }
        return common;

       
       // for(int i=0; i<words[0].size(); i++){
        //     for(int j=0; j<words[1].size(); j++){
        //         if(words[0][i]== words[1][j]){
        //             common.push_back(words[0][i]);
        //             break;
        //         }
        //     } 
            
        // }
    }
};
14800