[Solution] Make Palindrome 2 CodeChef Solution

You are given a binary string S$S$ of length N$N$. You want to obtain a palindrome from S$S$ by applying the following operation at most ⌊N2⌋$\lfloor \frac{N}{2}\rfloor$ times:

• Choose an index i(1≤i≤|S|)$i(1\le i\le |S|)$, delete the character Si$S_i$ from S$S$ and concatenate the remaining parts of the string. Here |S|$|S|$ denotes the current length of string S$S$.

For example, if S=$S=$ 11010, then applying the operation on index i=2$i=2$ makes S=$S=$ 1010.

Note that after each operation, the length of the string S$S$ decreases by one.

Find any palindrome you can obtain after the operations. It can be proved that it is always possible to obtain a palindrome from S$S$ under the given constraints.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Here, ⌊N2⌋$\lfloor \frac{N}{2}\rfloor$ denotes floor division of the integer N$N$ by 2$2$. For example, ⌊52⌋=2$\lfloor \frac{5}{2}\rfloor =2$, ⌊82⌋=4$\lfloor \frac{8}{2}\rfloor =4$. A binary string is a string that consists of only the characters 0 and 1.

Input Format

• The first line of input contains an integer T$T$, denoting the number of test cases. The T$T$ test cases

Passes for Fair CodeChef Solution

Fill Candies CodeChef Solution

Buy Lamps CodeChef Solution

Make Palindrome 2 CodeChef Solution

Fill The Grid CodeChef Solution

Positive array CodeChef Solution

Strict Permutation CodeChef Solution

•  then follow:
• The first line of each test case contains an integer N$N$, denoting the length of the binary string S$S$.
• The second line of each test case contains the binary string S$S$.

Output Format

For each test case, print on a separate line any palindromic string that can be obtained from S$S$ by applying the given operation at most ⌊N2⌋$\lfloor \frac{N}{2}\rfloor$ times.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤N≤100$1\le N\le 100$
• S$S$ contains only the characters 0 and 1.