<p>You are given an array of strings <code>words</code> and a string <code>chars</code>.</p>

<p>A string is <strong>good</strong> if it can be formed by characters from <code>chars</code> (each character can only be used once).</p>

<p>Return <em>the sum of lengths of all good strings in words</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;cat&quot;,&quot;bt&quot;,&quot;hat&quot;,&quot;tree&quot;], chars = &quot;atach&quot;
<strong>Output:</strong> 6
<strong>Explanation:</strong> The strings that can be formed are &quot;cat&quot; and &quot;hat&quot; so the answer is 3 + 3 = 6.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;hello&quot;,&quot;world&quot;,&quot;leetcode&quot;], chars = &quot;welldonehoneyr&quot;
<strong>Output:</strong> 10
<strong>Explanation:</strong> The strings that can be formed are &quot;hello&quot; and &quot;world&quot; so the answer is 5 + 5 = 10.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= words.length &lt;= 1000</code></li>
	<li><code>1 &lt;= words[i].length, chars.length &lt;= 100</code></li>
	<li><code>words[i]</code> and <code>chars</code> consist of lowercase English letters.</li>
</ul>

// class Solution {
// public:
//     int countCharacters(vector<string>& w, string chars) {
//        map<char,int>  m;
//        int sum=0;
//        for (auto i : chars){
//           m[i]++;
//        }
//         for(string word : w){
//             map<char,int> m1;
//             int flag=1;
//             for (auto j : word){
//              if(!m[j] || m1[j]==m[j]){
//                flag=0;
//                break;
//              }
//             m1[j]++;
//             }
//             if(flag==1)sum+=word.size();
//             }
//         return sum;
//     }
// };

class Solution {
public:
    bool canForm(string word, vector<int> count)
    {
       vector<int> c(26,0);
       for (char i: word){
        if (!count[i-'a'] || count[i-'a']==c[i-'a'])return false;
        c[i-'a']++;
       }
       return true;
    }
    int countCharacters(vector<string>& words, string chars) {
     vector<int> count(26,0);
     for(char i: chars){
        count[i-'a']++;
     }
     int c=0;
     for (string word :words){
        if(canForm(word,count))c+=word.size();
     }
    return c;
    }
};
33371