Minimum Number of Changes to Make Binary String Beautiful

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.

LeetCode Problem - 2914

class Solution {
    public int minChanges(String s) {
        // Get the length of the string
        int length = s.length();

        // Initialize a counter to track the number of changes needed
        int count = 0;

        // Loop through the string, considering pairs of adjacent characters
        // Increment i by 2 to examine pairs (i, i+1)
        for (int i = 0; i < length - 1; i += 2) {
            // Extract the two adjacent characters (temp0 and temp1)
            char temp0 = s.charAt(i);
            char temp1 = s.charAt(i + 1);

            // If the two characters are different, increment the count
            if (temp0 != temp1) {
                count++;
            }
        }

        // Return the total count of changes needed
        return count;
    }
}