You are given an array of strings words and a string chars.

A string in words is considered good if it can be formed using only the characters available in chars, where each character in chars may be used at most once per word.

Return the sum of the lengths of all good strings in words.

Constraints:

• $1 \leq$ words.length $\leq 1000$

• $1 \leq$ words[i].length, chars.length $\leq 100$

• words[i] and chars consist of lowercase English letters.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.