Given an array of strings patterns and a string word, return the number of strings in patterns that exist as a substring within word.

A substring is a contiguous sequence of characters within a string.

Constraints:

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

• $1 \leq$ patterns[i].length $\leq 100$

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

• patterns[i] and word 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.