You are given two strings s and pattern.

A substring of s is considered almost equal to pattern if it has the same length as pattern and differs from pattern in at most $1$ character.

Return the minimum starting index of a substring in s that is almost equal to pattern. If no such substring exists, return $-1$.

Constraints:

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

• s and pattern consist only 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.