Given a binary string, you can rotate any substring of this string. For Example, let string be denoted by s. Let the first element of string be represented by s, second element be represented by s and so on.
s = “100110111”
Suppose, we rotate the substring starting from s and ending at s. Then the string after this operation will be:
Resultant String = “101100111”
Now, you are allowed to do at most k operations to rotate any substring. You have to tell the maximum number of contiguous 1 you can make in this string in k or less than k rotations of substring.
Input : 100011001
k = 1
Output : 3
k is 1, hence you can rotate only once. Rotate the substring starting from s and ending at s. The resultant string will be : 111000001. Hence, maximum contiguous 1 are 3.
Input : 001100111000110011100
k = 2
Output : 8
k is 2, hence you can rotate twice. Rotate the substring starting at s and ending at s. Resultant string after first rotation : 001100001100011111100. Then, rotate the substring starting at s and ending at s. Resultant string after second rotation : 001100000001111111100. Hence, maximum number of contiguous 1 are 8.
Concept For Solving:
In order to solve this problem, we will maintain the frequency of 1’s in portion of contiguous 1’s in the original string in a multiset. Then on each rotation, we will rotate that substring such that, 2 portions of contiguous 1(with maximum frequency) in the string come together. We will do this, by sorting the multiset from greatest to smallest element. We will take out top 2 elements of multiset and insert their sum back into the multiset. We will continue to do this until k rotations are completed or number of elements in multiset is reduced to 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.
- Rotations of a Binary String with Odd Value
- Find element at given index after a number of rotations
- Number of strings which starts and ends with same character after rotations
- Find the Mth element of the Array after K left rotations
- Mth element after K Right Rotations of an Array
- Print all possible rotations of a given Array
- Find maximum value of Sum( i*arr[i]) with only rotations on given array allowed
- Maximum sum of i*arr[i] among all rotations of a given array
- Generate all rotations of a given string
- Minimum rotations required to get the same string
- Minimum rotations required to get the same String | Set-2
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Find the maximum possible Binary Number from given string
- Queries to find maximum sum contiguous subarrays of given length in a rotating array
- Print string after removing all (“10” or “01”) from the binary string
- Given a number as a string, find the number of contiguous subsequences which recursively add up to 9
- Given a number as a string, find the number of contiguous subsequences which recursively add up to 9 | Set 2
- Distinct state codes that appear in a string as contiguous sub-strings
- Contiguous subsegments of a string having distinct subsequent characters
- Longest palindromic string possible after removal of a substring
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.