You are given a string s and a pattern string p, where p contains lowercase English letters and exactly two wildcard characters '*'.

A wildcard character '*' can match any sequence of zero or more characters.

Return the minimum length of a substring of s that matches the pattern p. If no such substring exists, return $-1$.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• $2 \leq$ p.length $\leq 10^5$

• s contains only lowercase English letters.

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

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.