Question

Tahir and Mamta are woking in a project in TCS. Tahir being a problem solver came up with an interesting probler
Problem consists of a string of length N and contains only small case alphabets.
It will be followed by Q queries, in which each query will contain an integer P (1<=P<=N) denoting a position within
Mamta's task is to find the alphabet present at that location and determine the number of occurrence of same alpl
Mamta is busy with her office work. Therefore, she asked you to help her.
Constraints
1 <= N <= 500000
S consisting of small case alphabets
WWWWWWW
1 <= Q <= 10000
1 <= p <= N
WWW
- Input Format
WWW
First line contains an integer N, denoting the length of string.
Second line contains string Sitself consists of small case alphabets only ('a' - 'z).
C
SEE
omo
ya
WEWS
Tamir
Third line contains an integer Q denoting number of queries that will be asked.
Next o lines contains an integer P (1 <= P <= N) for which you need to find the number occurrence of character presen​

Answer 1

class solve

{

public static void main(String args[])

{

Scanner sc= new Scanner(System . in);

int arr [ ];

System . out . println("Enter the length of string");

int len=sc . nextInt();

arr =new int [ len ];

System . out . println("Enter the string");

string str=sc . next();

System . out . println("Enter number of queries to be made");

int q=sc . nextInt();

for ( int i = 0; i< q; i++)

{

int count =0;

System . out . println( "Enter the query" );

int p=sc . nextInt();

for (int j=0; j<p-1 ; j++)

{  

if( str . charAt ( j ) = = str . charAt ( p-1 ) )

{

count + + ;

}

}

arr [ i ] = count;

}

for ( int i= 0; i< q; i++)

{

System .  out .  println (arr [ i ]);

}

}

}