304 North Cardinal St.
Dorchester Center, MA 02124

# Different Consecutive Characters CodeChef Solution

## Different Consecutive Characters CodeChef Solution in C++17

``````#include <iostream>
#include<string>
using namespace std;

int main() {
int t;
cin>>t;
while(t>0){
int n,count=0;
string s;
cin>>n>>s;
for(int i=0;i<=n-2;i++)
{
if(s[i]==s[i+1])
count++;
}
cout<<count<<endl;
t--;
}
return 0;
}
``````

## Different Consecutive Characters CodeChef Solution in C++14

``````#include <iostream>
using namespace std;

int main() {
int t;
cin >> t;
while(t--){
int x;
cin >> x;
string n;
cin >> n;
int b=0;
for(int i=0;i<x-1;i++){
if(n[i]==n[i+1])
b++;
}
cout<<b<<endl;
}
}
``````

## Different Consecutive Characters CodeChef Solution in PYTH 3

``````# cook your dish here
T=int(input())
for i in range(0,T):
N=int(input())
S=input()
l=len(S)
k=0
m=l-1
for i in range(0,l):
if i != m:
if S[i]==S[i+1]:
k=k+1
else:
continue
print(k)    ``````

## Different Consecutive Characters CodeChef Solution in C

``````#include <stdio.h>
int main(void) {
int t,n,c,i;
char s[1000];
scanf("%d",&t);
while(t!=0)
{
c=0;
scanf("%d",&n);
scanf(" %s",s);
for(i=0;i<(n-1);i++)
{
if(s[i]==s[i+1])
c++;
}
printf("%d\n",c);
t=t-1;
}
return 0;
}
``````

## Different Consecutive Characters CodeChef Solution in JAVA

``````/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc =new Scanner(System.in);
int t =sc.nextInt();
for(int i =1;i<=t;i++)
{
int n =sc.nextInt();
String s =sc.next();
int c=0;
for(int j=0;j<n-1;j++)
{
if(s.charAt(j)==s.charAt(j+1))
c++;
}

System.out.println(c);
}
}
}``````

## Different Consecutive Characters CodeChef Solution in PYPY 3

``````# Author <<< MAVERICK >>>
import os, sys, math
#>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
ii  = lambda : int(input())                          # integer
si  = lambda : input()                               # string
mi  = lambda : map(int,input().strip().split(" "))   # mapping integer
msi = lambda : map(str,input().strip().split(" "))   # mapping string
li  = lambda : list(mi())                            # list integer input
lsi = lambda : list(msi())                           # list string input
#>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
alphabets = 'abcdefghijklmnopqrstuvwxyz'
a2n = {'a':0,'b':1,'c':2,'d':3,'e':4,'f':5,'g':6,'h':7,'i':8,'j':9,'k':10,'l':11,'m':12,'n':13,'o':14,'p':15,'q':16,'r':17,'s':18,'t':19,'u':20,'v':21,'w':22,'x':23,'y':24,'z':25}
n2a = {1:'a',2:'b',3:'c',4:'d',5:'e',6:'f',7:'g',8:'h',9:'i',10:'j',11:'k',12:'l',13:'m',14:'n',15:'o',16:'p',17:'q',18:'r',19:'s',20:'t',21:'u',22:'v',23:'w',24:'x',25:'y',26:'z'}
vow = ['a','e','i','o','u']
LOCAL = "D:\\Python\\CompetitiveProgramming\\Portable\\MAVERICK\\CPP"    # local directory
sys.stdin  = open(F'{LOCAL}/input.txt', 'r')            # input file location
sys.stdout = open(F'{LOCAL}/output.txt', 'w')           # output file location
def debug(anyTypeOfDataType):
with open("D:\\Python\\CompetitiveProgramming\\CodeForces\\debug.txt","w") as f: f.write(str(anyTypeOfDataType))
#>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> CUSTOM FUNCTIONS <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<

def main():
try:
solve()
except FileNotFoundError: solve()

'''
turns the number of ways to choose k items without repetition
math perm()
math factorial()
math fmod()
arr = [0]*10
arr2 = arr.copy()
sympy.isprime(n)
list(sympy.primerange(1,20))
list(sympy.sieve.primerange(1,20))
count()
find()
index()
combinations(pair,2)
x.isalphanumeric()
x.isdecimal()
x.isdigit()
x.islower()
x.isspace()
x.isupper()
x.islower()
x.strip() removes all the trailing spaces
x.index(value) returns the index of the variable
x.remove(element) removes all the elements of the given value matched
x.reverse()

Set Methods >>>
set.clear()
set.intersection()
set.issubset()
set.pop()
set.remove(item)
set.union()

del dictionary[key]
dictionary.get(keyname)

combinations() not permutations

'''

def solve():

#>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> MAIN CODE GOES HRER <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
# for t in range(ii()):
# reversed()
# a.sort()

for i in range(ii()):
test = ii()
s = si()
counter = 0
if len(s)==1:
pass
elif len(s) > 1:
idx = 1

prev = s[0]
while idx < test:
if s[idx]!=prev:
prev = s[idx]
pass # not same
elif s[idx]==prev:
# same
counter+=1
prev = s[idx]
idx+=1
print(counter)

#>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> END OF CODE <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
if __name__ == "__main__": main()
``````

## Different Consecutive Characters CodeChef Solution in PYTH

``````# cook your code here
for i in range(int(raw_input())):
n=int(raw_input())
s=list(raw_input())
c=0
for i in range(1,n):
if s[i-1]==s[i]:
c+=1
else:
i+=1
print(c)
``````

## Different Consecutive Characters CodeChef Solution in C#

``````using System;

public class Test
{
public static void Main()
{

for (int i = 0; i < numberOfTests; i++)
{
int operations = 0;
for (int len = 0; len < stringLength - 1; len++)
{
if (sample[len] == sample[len + 1])
{
operations++;
}
}
Console.WriteLine(operations);
}
}
}
``````

## Different Consecutive Characters CodeChef Solution in NODEJS

``````process.stdin.resume();
process.stdin.setEncoding('utf8');

let input = ''

function checkInput(data) {
input += data
}

function prepareInput() {
input = input.split('\n')
}

function main() {
prepareInput()

let N = input.splice(0, 1)

for(let i=1; i<N*2; i+=2) {
let str = input[i]

let arr = str.match(/(.)\1{1,}/g) || ['0']
let mappedArr = arr.map(el => el.length-1).reduce((acc, cur) => acc+cur, 0)

process.stdout.write(mappedArr + '\n')
}

process.exit()
}

process.stdin.on('data', checkInput).on('end', main)

``````

## Different Consecutive Characters CodeChef Solution in GO

``````package main
import "fmt"

func main(){
var t int
fmt.Scanln(&t)
for i:=0;i<t;i++{
var n int
fmt.Scanln(&n)
var str string
fmt.Scanln(&str)
var isSame, ans int
isSame=1
for i:=1;i<len(str);i++{
if str[i]==str[i-1]{
isSame = isSame+1
} else {
ans = ans + isSame-1
isSame = 1
}
}
ans = ans + isSame-1
fmt.Println(ans)
}
}
``````
##### Different Consecutive Characters CodeChef Solution Review:

In our experience, we suggest you solve this Different Consecutive Characters CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Different Consecutive Characters CodeChef Solution.

Find on CodeChef

##### Conclusion:

I hope this Different Consecutive Characters CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Programming Language in a business context; there are no prerequisites.

Keep Learning!