<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:
     unordered_map<char , int> letsSay(string c){
        unordered_map<char, int> mp;
           for(auto i:c) mp[i]++;
           return mp;
     }
    int solve(vector<string>& w , string c){
       int n = w.size();
       int sum =0;
        for(auto i: w){
           unordered_map<char, int> mp = letsSay(c);
           bool flag = true;
            for(auto j:i){
                if(mp.find(j)!=mp.end() && mp[j] >0){
                    mp[j]--;
                }else{
                    flag = false;
                    break;
                }
            }
            if(flag) {
                // cout<<i<<" "<<i.length()<<endl;
                sum+= i.length();
            }
        }

        return sum;

    }
    int countCharacters(vector<string>& w, string c) {
        // int ans = 0;

        // for (int i = 0; i < words.size(); i++) {
        //     bool flag = false;
        //     for (int j = 0; j < words[i].length(); j++) {
        //         if (chars.find(words[i][j]) == string::npos) {
        //             // ans += words[i].length();
        //             flag = true;
        //             break;
        //         }
        //     }
        //     if(!flag) ans+= words[i].length();
        // }
        return solve(w, c);
    }
};
59158