Codeforces Round #793 (Div. 2) 1682A. Palindromic Indices Solution

Problem Link: https://codeforces.com/contest/1682/problem/A

 Solution in C++: 

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int  t,n,x,i,j;

    cin>>t;

    while(t--)

    {

        string s;

        cin>>n>>s;

        int cnt=0;

        if(n&1)cnt++;

        x=n/2;

        for(i=x-1;i>=0;i--)

        {

            if(s[i]==s[x])

                cnt+=2;

            else

                break;

        }

        cout<<cnt<<endl;

    }

}