Smallest Substring With Identical Characters II

You are given a binary string s of length n and an integer numOps.

You are allowed to perform the following operation on s at most numOps times:

Select any index i where 0 <= i < n and flip s[i]. If s[i] == '1', change s[i] to '0', and vice versa.

You need to minimize the length of the longest substring of s such that all the characters in the substring are identical.

Return the minimum length after the operations.

Example 1

Inputs = "000001", numOps = 1

Output2

By changing s[2] to '1', s becomes "001001", whose longest substrings with identical characters have length 2.

Example 2

Inputs = "0000", numOps = 2

Output1

By changing s[0] and s[2] to '1', s becomes "1010", so every longest substring with identical characters has length 1.

Constraints