You are given an array of strings words and an array of strings puzzles.

A string word is considered valid with respect to a string puzzle if both of the following conditions are satisfied:

• word contains the first letter of puzzle.

• Every character present in word is also present in puzzle.

Return an array answer where answer[i] is the number of words in words that are valid with respect to puzzles[i].

Constraints:

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

• $4 \leq$ words[i].length $\leq 50$

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

• puzzles[i].length $= 7$

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

• Each puzzles[i] does not contain repeated characters.

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.