Available question text
Given two equal-length strings and a budget, find the maximum-length contiguous substring where the sum of per-character absolute ASCII differences between s and t is <= maxCost. This is solved by a sliding-window/two-pointer approach to maintain the running cost and maximize window length in O(n).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1208. Get Equal Substrings Within Budget
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source