**Alternating Characters Problem:**

You are given a string containing characters and only. Your task is to change it into a string such that there are no matching adjacent characters. To do this, you are allowed to delete zero or more characters in the string.

Your task is to find the minimum number of required deletions.

**Example**

Remove an at positions and to make in deletions.

**Function Description**

Complete the *alternatingCharacters* function in the editor below.

alternatingCharacters has the following parameter(s):

*string s*: a string

**Returns**

*int:*the minimum number of deletions required

**Input Format**

The first line contains an integer , the number of queries.

The next lines each contain a string to analyze.

**Constraints**

- Each string will consist only of characters and .

**Sample Input**

```
5
AAAA
BBBBB
ABABABAB
BABABA
AAABBB
```

**Sample Output**

```
3
4
0
0
4
```

**Explanation**

The characters marked red are the ones that can be deleted so that the string does not have matching adjacent characters.

**Solution**:

```
int alternatingCharacters(string s) {
int n = s.length();
int count = 0;
for(int i=0;i<n;i++){
if(s[i] == s[i+1]){
count++;
}
}
return count;
}
```

I am solve this in vey simple way, I hope you understand this and if still not then comment down below as soon as I reach you.