You are given a string s and a pattern string p. The pattern p contains lowercase English letters and exactly one '*' character.

The '*' character can be replaced with any sequence of zero or more characters.

Return true if p can match any substring of s after replacing the '*', and false otherwise.

Note: A substring is a contiguous non-empty sequence of characters within a string.

Constraints:

• $1 \leq$ s.length $\leq 50$

• $1 \leq$ p.length $\leq 50$

• s contains only lowercase English letters.

• p contains only lowercase English letters and exactly one '*'.

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.