<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> getDict(string s) {
       unordered_map<char, int> charDict = {};
        for (int i = 0; i < s.size(); i++) {
            if (charDict.find(s.at(i)) == charDict.end()) {
                charDict[s.at(i)] = 1;
            } else {
                charDict[s.at(i)] += 1;
            }
        }
        return charDict;
    }
    
    int canBeFormed(string word, unordered_map<char, int> charDict ) {
        for (int i = 0; i < word.size(); i++) {
            if (charDict.find(word.at(i)) == charDict.end()) {
                return 0;
            } else {
                if (charDict[word.at(i)] == 0) return 0;
                charDict[word.at(i)] -= 1;
            }
        } 
        return word.size();
    }
    
    int countCharacters(vector<string>& words, string chars) {
        int res = 0;
        unordered_map<char, int> charDict = getDict(chars);
        for (int i = 0; i < words.size(); i++) {
            // cout <<  canBeFormed(words[i], charDict) << "\n";
            if (words[i].size() <= chars.size()) res = res + canBeFormed(words[i], charDict);
        }
        return res;
    }
};
37581