Leetcode 3398. Smallest Substring With Identical Characters I

Given a binary string and up to numOps bit flips, minimize the length of the longest contiguous block of identical characters after at most numOps operations. The core challenge is optimally allocating flips to split long runs (typically solved by binary-searching the target maximum length and using a greedy/DP feasibility check).