Given a string s and an array of strings words, determine if s is a prefix string of words.

A string s is a prefix string of words if it can be formed by concatenating the first $k$ strings in words sequentially, where $k$ is some integer such that $1 \le k \le$ words.length.

Return true if s is a prefix string of words, or false otherwise.

Constraints:

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

• $1 \le$ words[i].length $\le 20$

• $1 \le$ s.length $\le 1000$

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