Available question text
Given a string of 'T'/'F' answers and at most k flips, maximize the length of a contiguous run of identical answers by changing up to k characters. This reduces to finding the longest substring containing at most k characters different from a chosen target ('T' or 'F'), typically solved with a sliding-window/two-pointer approach.
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 2024. Maximize the Confusion of an Exam
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source