The Next Big Thing: Hackerearth Problem and Solution

The Next Big Thing: Hackerearth Problem and Solution in java

Problem:

Saharsh (aka The Next Big Thing) has a lots of ups and downs in his coding life. He rates his performance of each contest as color code. He has 5 different color codes - "Purple"-P , "Blue"-B, "Yellow"-Y, "Orange"-O and "Red"-R. P is the code for worst performance and R for the best.
Saharsh keeps track of all his performances using performance string, where i'th character of it denotes the performance code for i'th contest.
Vaibhav, his friend, is a big stalker and is interested in knowing the number of times Saharsh became "Red" coder immediately after being "Orange" coder.

Input

First line contains a single integer t denoting the number of test cases.
Each of the next t lines contains a string s denoting his performance string.

Output

For each testcase, print a single line containing required output.

Constraints

1 <= t <= 20
1 <= length(s) <= 10^5

SAMPLE INPUT

 

4
BYORPO
ORBPYYOR
ROROROR
ROOOP

SAMPLE OUTPUT

 

1
2
3
0

Explanation

Test case 1 :
In 'BYORPO' , OR pair occurs exactly once.
Test case 2 :
In 'ORBPYYOR' , OR pair occurs twice.
Test case 4 :
In 'ROOOP' , no OR pair occurs.

Solution in java:

import java.util.*;


class TestClass {
    public static void main(String args[] ) throws Exception {
        
        Scanner s = new Scanner(System.in);
        int N = s.nextInt();

        for (int i = 0; i<=N; i++) {
           
            String msg = s.nextLine();
            int count=0;
            for(int j=0;j<msg.length();j++){
                  if(msg.charAt(j)=='O'){
                      if(j+1<msg.length() && msg.charAt(j+1)=='R' )
                          count++;
                          
                  }
                  
                  if(j==msg.length()-1)
                  System.out.println(count);   
             
            }
                  
        }

     }

}