[Solution] Yet Another Palindrome Making Problem CodeChef Solution

Chef has a string A$A$ (containing lowercase Latin letters only) of length N$N$ where N$N$ is even. He can perform the following operation any number of times:

• Swap Ai$A_i$ and Ai+2$A_{i+2}$ for any 1≤i≤(N−2)$1\le i\le (N-2)$

Determine if Chef can convert string A$A$ to a palindromic string.

Note: A string is called a palindrome if it reads the same backwards and forwards. For example, noon$\mathtt{\text{noon}}$ and level$\mathtt{\text{level}}$ are palindromic strings but ebb$\mathtt{\text{ebb}}$ is not.

Input Format

• The first line contains a single integer T$T$ — the number of test cases. Then the test cases follow.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

• The first line of each test case contains an integer N$N$ — the length of the string A$A$.
• The second line of each test case contains a string A$A$ of length N$N$ containing lowercase Latin letters only.

Output Format

For each test case, output YES if Chef can convert the string A$A$ to a palindromic string. Otherwise,

True and False Paper CodeChef Solution

The Last Levels CodeChef Solution

Easy Pronunciation CodeChef Solution

Yet Another Palindrome Making Problem CodeChef Solution

Largest Family Codechef Solution

Maximum Median Matching CodeChef Solution

Consecutive XOR Codechef Solution

Interior Design Codechef Solution

 output NO.

You may print each character of YES and NO in either uppercase or lowercase (for example, yes, yEs, Yes will be considered identical).

Constraints

• 1≤T≤200$1\le T\le 200$
• 1≤N≤1000$1\le N\le 1000$