You are given two strings, s and t.

Return the maximum length of the longest common prefix shared by s and t after deleting at most $1$ character from s.

Constraints:

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

• $1 \leq$ 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.