Minimum Changes To Make Binary String Beautiful In 60 Characters
Make binary string beautiful by partitioning into substrings with even length & only 1's or 0's. Change minority char in each block to match majority. Time complexity: O(n), space complexity: O(1).
2914. Minimum Number of Changes to Make Binary String Beautiful Difficulty: Medium Topics: String You are given a 0-indexed binary string s having an even length. A string is beautiful if it's possible to partition it into one or more substrings such that: Each substring has an even length. Each substring contains only 1's or only 0's. You can change any character in s to 0 or 1. Return the minimum number of changes required to make the string s beautiful. Example 1: Input: s = "1001" Output: 2 Explanation: We change s[1] to 1 and s[3] to 0 to get string "1100". It can be seen that the str...