Input: S = “1100011“
Operation 1: Removal of all 0s modifies S to “1111“.
Operation 2: Removal of all remaining 1s makes S empty.
Therefore, the minimum number of operations required is 2.
Input: S = “0010100“
Operation 1: Removal of all 1s modifes S to “000100“.
Operation 2: Removal of all 1s modifies S = “00000“.
Operation 3: Removal of all remaining 0s makes S empty.
Therefore, the minimum number of operations required is 3.
Approach: The given problem can be solved using Greedy Approach. The idea is to delete the consecutive occurrences of the character with higher frequency. Follow the steps below to solve the problem:
- Traverse the given string S and generate a new string, say newString, by removing consecutive occurrences of the character with higher frequency.
- Finally, print (sizeof(newString) + 1)/2 as the required answer
Below is the implementation of the above approach:
Time Complexity: O(N)
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.
- Minimum removal of subsequences of distinct consecutive characters required to empty a given string
- Longest subarray of non-empty cells after removal of at most a single empty cell
- Minimum removal of characters required such that permutation of given string is a palindrome
- Cost required to empty a given array by repeated removal of maximum obtained by given operations
- Lexicographically largest string possible consisting of at most K consecutive similar characters
- Sum of all possible strings obtained by removal of non-empty substrings
- Minimum addition/removal of characters to be done to make frequency of each character prime
- Minimum characters that are to be inserted such that no three consecutive characters are same
- Minimum characters required to be removed to sort binary string in ascending order
- Minimum cost of flipping characters required to convert Binary String to 0s only
- Maximum length of balanced string after swapping and removal of characters
- Lexicographically largest possible String after removal of K characters
- Rearrange the characters of the string such that no two adjacent characters are consecutive English alphabets
- Generate a Binary String without any consecutive 0's and at most K consecutive 1's
- Minimum swaps to group similar characters side by side?
- Minimum adjacent swaps to group similar characters together
- Maximize length of Subarray of 1's after removal of a pair of consecutive Array elements
- Maximize cost of deletions to obtain string having no pair of similar adjacent characters
- Minimum number of palindromic subsequences to be removed to empty a binary string
- Operations required to make the string empty
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.