Beautiful String Problem Statement

Given a binary string STR containing either '0' or '1', determine the minimum number of operations needed to make it beautiful. A binary string is called beautiful if it contains alternating 0s and 1s.

Example:

Input:

STR = '0010'

Output:

1

Explanation:

In one operation, convert the first '0' to '1', making the string '1010', which is beautiful.

Input:

The first line contains an integer 'T' which denotes the number of test cases. Each test case contains a binary string 'STR'.

Output:

For each test case, print the minimum number of operations needed to make 'STR' beautiful. Print the output of each test case in a separate line.

Constraints:

• 1 ≤ T ≤ 100
• 2 ≤ |STR| ≤ 105
• STR[i] ∈ {'1', '0'}
• Time Limit: 1 sec

Note:

You do not need to print the expected output; just implement the function.