You are given a binary string s and an integer k.
In one operation, you can choose exactly k distinct indices in s and flip the character at each chosen index, changing '0' to '1' and '1' to '0'.
Return the minimum number of operations required to make every character in s equal to '1', or
Constraints:
s.length
s[i] is either '0' or '1'.
k s.length
You are given a binary string s and an integer k.
In one operation, you can choose exactly k distinct indices in s and flip the character at each chosen index, changing '0' to '1' and '1' to '0'.
Return the minimum number of operations required to make every character in s equal to '1', or
Constraints:
s.length
s[i] is either '0' or '1'.
k s.length