Palindromic Indices Codeforces Solution | Codeforces Problem Solution 2022

Palindromic Indices Codeforces Solution | Codeforces Problem Solution 2022

A. Palindromic Indices

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a palindromic string 𝑠$s$ of length 𝑛$n$.

You have to count the number of indices 𝑖$i$ (1≤𝑖≤𝑛)$(1\le i\le n)$ such that the string after removing 𝑠𝑖$s_i$ from 𝑠$s$ still remains a palindrome.

For example, consider 𝑠$s$ = "aba"

1. If we remove 𝑠1$s_1$ from 𝑠$s$, the string becomes "ba" which is not a palindrome.
2. If we remove 𝑠2$s_2$ from 𝑠$s$, the string becomes "aa" which is a palindrome.
3. If we remove 𝑠3$s_3$ from 𝑠$s$, the string becomes "ab" which is not a palindrome.

Solution Click Below:-  CLICK HERE

Input

The input consists of multiple test cases. The first line of the input contains a single integer 𝑡$t$ (1≤𝑡≤103)$(1\le t\le {10}^3)$  — the number of test cases. Description of the test cases follows.

Palindromic Indices Codeforces Solution

AND Sorting Codeforces Solution 

LIS or Reverse LIS? Codeforces Solution

Circular Spanning Tree Codeforces Solution

Unordered Swaps Codeforces Solution

MCMF? Codeforces Solution

The first line of each testcase contains a single integer 𝑛$n$ (2≤𝑛≤105)$(2\le n\le {10}^5)$  — the length of string 𝑠$s$.

The second line of each test case contains a string 𝑠$s$ consisting of lowercase English letters. It is guaranteed that 𝑠$s$ is a palindrome.

It is guaranteed that sum of 𝑛$n$ over all test cases does not exceed 2⋅105$2\cdot {10}^5$.

Output

For each test case, output a single integer  — the number of indices 𝑖$i$ (1≤𝑖≤𝑛)$(1\le i\le n)$ such that the string after removing 𝑠𝑖$s_i$ from 𝑠$s$ still remains a palindrome.