I have the same problem. Locally I am able to run all test cases and they produce correct answers within seconds, but here they get terminated due to timeout.

yes I passed all 12. My Alg is also O(n). So what is the problem you are facing? And what language you are using. You can check my solution as well and let me know where I can see your solution.

Yep - I did. Mine is O(n) too but I don't think you can do better than that as you'll need to go through the string at least once.

The better solution is O(n/2). If your program is not optimed, then it "MAY" thow "Timeout" as it exceeds the maximum time limit.

Yes. I have passed all the test cases.

Passed, with C++.

include

include

include

include

int main() {

/* Enter your code here. Read input from STDIN. Print output to STDOUT */  
char str[100000];
long int len;
int t, i, j,dcount;
scanf("%d", &t);
while(t--){
scanf("%s", str);
len = strlen(str);
dcount = 0;
    i=0;j=1;
    while(j<len){
    if(str[i]==str[j]){
    dcount++;
        j++;
    }
        else{
            i=j;
            j++;
        }
    }

    printf("%d\n", dcount);
}
return 0;

}

Hey !! even i had the same problem !! I was using java. When i changed my string from Sring class to StringBuffer... it worked.

I know that the reply is 8months late.. :P :P But it may be helpful for others.

yeah . Mine is O(n).

try and analyze this. I'm giving you the source code.

include

include

include

include

int main() { int i,j,c=0,x,k; char a[100]; scanf("%d",&i);

while(i--)
    { c=0;            //refreshing the counter
   scanf("%s",a);
    x=strlen(a);       //length of string
    for(j=0;j!=x-1;j++)   //no need to traverse till end                                 //but end-1
        {

        if(a[j] ==a[j+1])     //calc. those which are same
          {  c++;

          }

    }
    printf("%d\n",c);

}

return 0;

}

oh my god,is that string consist of the letter only 'A' or 'B'?If you care it,you will fail to pass additional case.That's a bug.

oh my god,is that string consist of the letter only 'A' or 'B'?If you care it,you will fail to pass additional case.That's a bug.

number = int(raw_input()) for k in range(1,number+1): string = raw_input().strip() i = len(string) -1 # scan for two consecutive del_count = 0 #characters, if found increase while i >0: #delete count if string[i] == string[i-1]: del_count = del_count+1 i = i-1

print del_count

number = int(raw_input()) for k in range(1,number+1): string = raw_input().strip() i = len(string) -1 # scan for two consecutive del_count = 0 #characters, if found increase while i >0: #delete count if string[i] == string[i-1]: del_count = del_count+1 i = i-1

print del_count

i was concatenating the strings for testing purpose and that happened. The I delete those lines and passed all the test cases

Scanner in =new Scanner(System.in); int n=in.nextInt();

    for(int i=0; i<n; i++)
        { int count=0;
        String s=in.next();
        int l=s.length();
        for(int j=0; j<l-1;j++)
            {
            if(s.charAt(j)==s.charAt(j+1))
                {

                count++;

            }
        }
        System.out.println(count);
    }

This will work time complexity O(N) Auxiliary Space O(N)

import java.io.; import java.util.; import java.text.; import java.math.; import java.util.regex.*;

public class Solution {

public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int t = sc.nextInt();
    sc.nextLine();
    for(;t>0;t--){
        StringBuffer a = new  StringBuffer(sc.nextLine());
        StringBuffer b = new  StringBuffer("");
        b.append(a.charAt(0));
        for(int i=1; i<a.length();i++){
            if(b.charAt(b.length()-1)!=a.charAt(i))b.append(a.charAt(i));
        }
        System.out.println(a.length()-b.length());
    }
}

}

public static void main(String[] args) { /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */ Scanner in = new Scanner(System.in); int n = in.nextInt(); for(int i=0;i

function alternatingCharacters(s){
    let count = 0;
    for(x in s){
        if(s[x] === s[parseInt(x)+1]){
            count++;
        }
    }
    return count;
}

Here is mine! passed all test cases.

// Complete the alternatingCharacters function below.
static int alternatingCharacters(String s) {
    StringBuilder sb = new StringBuilder(s);
    int deletion=0;
    int i=0;
    while(!isAlternateCharacter(sb)) {
        if(sb.charAt(i)==sb.charAt(i+1)){
            sb.deleteCharAt(i+1);
            deletion++;
            i=0;
        } else {
            i++;
        }

    }
    return deletion;
}

static boolean isAlternateCharacter(StringBuilder str) {
    for(int i=0;i<str.length()-1;i++) {
        if(str.charAt(i)==str.charAt(i+1)) {
            return false;
        }
    }
    return true;
}