You are given a string s of even length n. String s is twofold, at the end of the day, comprises just of 0's and 1's. String s has precisely n2 zeroes and n2 ones (n is even). In one activity you can invert any substring of s. A substring of a string is an adjoining aftereffect of that string.
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.
You are given a string s of even length n. String s is twofold, at the end of the day, comprises just of 0's and 1's.
String s has precisely n2 zeroes and n2 ones (n is even).
In one activity you can invert any substring of s. A substring of a string is an adjoining aftereffect of that string.
What is the base number of tasks you really want to make string s rotating? A string is rotating if si≠si+1 for all I. There are two kinds of exchanging strings overall: 01010101... or on the other hand 10101010...
Input
The principal line contains a solitary integer t (1≤t≤1000) — the number of experiments.
The principal line of each experiment contains a solitary integer n (2≤n≤105; n is even) — the length of string s.
The second line of each experiment contains a parallel string s of length n (si∈ {0, 1}). String s has precisely n2 zeroes and n2 ones.
It's surefire that the complete amount of n over experiments doesn't surpass 105.
Output
For each experiment, print the base number of activities to make s rotating.
Step by step
Solved in 4 steps with 1 images
