Anti Palindrome Solution|Codesheff starter 24 for div 3

1

$1$-indexed) string S$S$ of length N$N$ is said to be anti-palindrome if, for each 1≤i≤N$1\le i\le N$, Si≠S(N+1−i)$S_i\ne S_{(N+1-i)}$.

You are given a string S$S$ of length N$N$ (consisting of lowercase Latin letters only). Rearrange the string to convert it into an anti-palindrome or determine that there is no rearrangement which is an anti-palindrome.

If there are multiple rearrangements of the string which are anti-palindromic, print any of them.

Input Format

• The first line of input contains a single integer T$T$ — the number of test cases. The description of T$T$ test cases follows.
• The first line of each test case contains an integer N$N$ — the length of the string S$S$.
• The second line of each test case contains the string S$S$.

Output Format

For each test case, if it is possible to rearrange S$S$ to convert it into an anti-palindrome, print YES in the first line and print the rearranged string in the second line. Otherwise, print NO.

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

If there are multiple rearrangements of the string which are anti-palindromic, print any of them.

Constraints

• 1≤T≤104$1\le T\le {10}^4$
• 1≤N≤105$1\le N\le {10}^5$
• S$S$ contains only lowercase Latin letters
• It is guaranteed that the sum of N$N$ over all test cases does not exceed 2⋅105$2\cdot {10}^5$.

Sample Input 1 

4
3
abc
8
abccccdd
4
xyyx
6
ppppqr

Sample Output 1 

NO
YES
abddcccc
YES
xxyy
NO

Explanation

Test case 1$1$: No matter how the string is rearranged, the condition Si≠S(N+1−i)$S_i\ne S_{(N+1-i)}$ will not be satisfied for i=2$i=2$.

Test case 2$2$: One possible rearrangement of the string which is anti-palindromic is abddcccc. Other answers, such as ccdaccdb, will also be accepted.

Test case 3$3$: One possible rearrangement of the string which is anti-palindromic is xxyy.

Test case 4$4$: It can be shown that none of the rearrangements of A$A$ is anti-palindromic.

Solution:

solution link 1

https://shareus.in/?i=yScFNErxQ

if 1st link is not work then click on another link

Solution link 2

https://shrinke.me/0joa

Solution link 3

https://afly.pro/4dPM5oi

Solution link 4

https://afly.pro/X6gV2u4

How to get link tutorial video link

https://youtu.be/0TSsPHhgwb4