You are given a $0$ indexed binary string s having an even length.

A binary string is considered beautiful if it can be partitioned into one or more disjoint substrings such that:

• Each substring has an even length.

• Each substring consists entirely of '$0$'s or entirely of '$1$'s.

You can change any character in s from '$0$' to '$1$' or from '$1$' to '$0$'.

Return the minimum number of changes needed to make s beautiful.

Constraints:

• $2 \leq$ s.length $\leq 10^5$

• s has an even length.

• s[i] is either '$0$' or '$1$'.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.