Get Equal Substrings Within Budget

lcpy gen -n 1208   # by problem number
lcpy gen -s get_equal_substrings_within_budget   # by problem name

Input: s = "abcd", t = "bcdf", maxCost = 3
Output: 3
Explanation: "abc" of s can change to "bcd".
That costs 3, so the maximum length is 3.

Input: s = "abcd", t = "cdef", maxCost = 3
Output: 1
Explanation: Each character in s costs 2 to change to character in t,  so the maximum length is 1.

Input: s = "abcd", t = "acde", maxCost = 0
Output: 1
Explanation: You cannot make any change, so the maximum length is 1.

class Solution:
    # Time: O(len(s))
    # Space: O(1)
    def equal_substring(self, s: str, t: str, max_cost: int) -> int:
        best = 0
        left = 0
        cost = 0
        for right, (a, b) in enumerate(zip(s, t, strict=True)):
            cost += abs(ord(a) - ord(b))
            while cost > max_cost:
                cost -= abs(ord(s[left]) - ord(t[left]))
                left += 1
            best = max(best, right - left + 1)
        return best