Sponsored
Sponsored
The aim here is to transform the given string into either "010101..." or "101010...", as these are the only two possible alternating patterns for a binary string. By comparing the given string to these patterns, we can determine the minimum number of operations required.
We create these patterns for the length of the string and then count mismatches for both patterns by iterating through the string.
Time Complexity: O(n), where n is the length of the string, due to the single pass through the string.
Space Complexity: O(1), as only a constant amount of extra space is used.
1function minOperations(s) {
2 let pattern1 = 0, pattern2 = 0;
3 for (let i = 0; i < s.length; i++) {
4 if (s[i] !== (i % 2 === 0 ? '0' : '1')) pattern1++;
5 if (s[i] !== (i % 2 === 0 ? '1' : '0')) pattern2++;
6 }
7 return Math.min(pattern1, pattern2);
8}
9
10const s = "0100";
11console.log(minOperations(s));The JavaScript solution counts mismatches against two alternating patterns by iterating over the string, then returns the minimum mismatch count, which represents the operations required to make the string alternating.
This method involves precomputing two mask strings that represent the possible alternating strings for any given length. We perform a comparison between the string and both masks, incrementing a counter for each mismatch, and outputting the smaller of the two.
Time Complexity: O(n).
Space Complexity: O(n) for mask storage.
1
In this solution, two mask strings are created to represent the two possible alternating patterns. The given string is then compared to each mask to count the number of changes required, with the minimum count being returned.