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.