You are given two strings s and t.

Return true if s can become a subsequence of t by replacing at most $1$ character in s with any lowercase English letter, or false otherwise.

Note: A subsequence of a string is a new string formed from the original string by deleting some (can be none) of the characters without disturbing the relative order of the remaining characters.

Constraints:

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

• s and t 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.