You are given two strings s and t of the same length, along with an integer maxCost.

Changing the character s[i] to t[i] costs $|$s[i] $-$ t[i]$|$, which represents the absolute difference between their ASCII values.

Return the maximum length of a substring of s that can be transformed to match the corresponding substring of t with a total cost less than or equal to maxCost. If no such substring can be transformed within the given budget, return $0$.

Constraints:

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

• t.length $==$ s.length

• $0 \leq$ maxCost $\leq 10^6$

• 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.