Leetcode 3399. Smallest Substring With Identical Characters II
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.