Minimum Changes to Make Alternating Binary String.

Q - You are given a string s consisting only of the characters '0' and '1'. In one operation, you can change any '0' to '1' or vice versa.

The string is called alternating if no two adjacent characters are equal. For example, the string "010" is alternating, while the string "0100" is not.

Return the minimum number of operations needed to make s alternating.

LeetCode Problem: Link | Click Here

class Solution {
    public int minOperations(String s) {
        int operationForZero = 0; // Represents the count of operations needed to make the string start with '0' pattern.
        int operationForOne = 0; // Represents the count of operations needed to make the string start with '1' pattern.

        // Loop through the string characters
        for (int i = 0; i < s.length(); i++) {
            // Check for even positions in the string
            if (i % 2 == 0) {
                // If the character is '0' at even position, count operationForZero
                if (s.charAt(i) == '0') {
                    operationForZero++; // Count operations for '0' at even positions
                } else {
                    operationForOne++; // Count operations for '1' at even positions
                }
            } else { // Odd positions in the string
                // If the character is '1' at odd position, count operationForZero
                if (s.charAt(i) == '1') {
                    operationForZero++; // Count operations for '1' at odd positions
                } else {
                    operationForOne++; // Count operations for '0' at odd positions
                }
            }
        }

        // Return the minimum operations required to make the string uniform
        return Math.min(operationForZero, operationForOne);
    }
}