Minimize flips to make binary string as all 1s by flipping characters in substring of size K repeatedly
Given a binary string S of size N and an integer K, the task is to find the minimum number of operations required to make all characters as 1s in the binary string by flipping characters in the substring of size K. If it is not possible to do so, then print “-1”.
Input: S = “00010110 “, K = 3
Below are the operations performed:
- Consider the substring S[0, 2] which is of size K(= 3) and flipping those characters modifies the string to “11110110”.
- Consider the substring S[4, 6] which is of size K(= 3) and flipping those characters modifies the string to “11111000”.
- Consider the substring S[5, 7] which is of size K(= 3) and flipping those characters modifies the string to “11111111”.
After the above operations, all the 0s are converted to 1s, and the minimum number of operations required is 3.
Input: S = “01010”, K = 4
Approach: The given problem can be solved using the Greedy Approach. Follow the below steps to solve the problem:
- Initialize a variable, say minOperations as 0 that stores the count of the minimum number of operations required.
- Traverse the string S using the variable i and if the characters S[i] is ‘0’ and the value of (i + K) is at most K, then flip all the characters of the substring S[i, i + K] and increment the value of minOperations by 1.
- After the above operations, traverse the string S and if there exists any character ‘0’ then print “-1” and break out of the loop.
- If all the characters of the string S are 1s, then print the minOperations as the resultant minimum number of operations.
Below is the implementation of the above approach:
Time Complexity: O(N*K)
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.