You are given a string allowed consisting of distinct characters and an array of strings words. A string is considered consistent if every character in it appears in the string allowed.

Return the total number of consistent strings in the array words.

Constraints:

• $1 \leq$ words.length $\leq 10^4$

• $1 \leq$ allowed.length $\leq 26$

• $1 \leq$ words[i].length $\leq 10$

• The characters in allowed are distinct.

• words[i] and allowed contain only lowercase English letters.

Now, 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.