Given an array of strings words and a string pref, return the number of strings in words that contain pref as a prefix.

Note: A prefix of a string is any leading contiguous substring of that string.

Constraints:

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

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

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