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

A prefix of a string is a leading contiguous substring.

Return the number of strings in words that are a prefix of s. If the same string appears multiple times in words, count each occurrence independently.

Constraints:

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

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

• words[i] and s consist only of 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.