Available question text
Given a binary string s and up to numOps bit flips, find the smallest possible length of the longest contiguous block of identical characters after at most numOps flips. Typical solution pattern: binary-search the target max-run length and use a greedy/prefix-sum sliding-window check to test feasibility.
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 3399. Smallest Substring With Identical Characters II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source