You are given two strings, s and t.

You are allowed to remove a contiguous substring from t starting at index left and ending at index right, where $0 \leq$ left $\leq$ right $<$ t.length. The score of this operation is defined as right $-$ left $+ 1$. If no substring is removed, the score is $0$.

Return the minimum possible score such that the remaining characters of t form a subsequence of s.

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 changing the relative order of the remaining characters.

Constraints:

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

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