Xor Palindrome solution codechef

Xor Palindrome solution codechef You are given a binary string AA of length NN. You can perform the following type of operation on the string AA: Choose two different indices ii and jj (1≤i,j≤N)(1≤i,j≤N); Change AiAi and AjAj to Ai⊕AjAi⊕Aj. Here ⊕⊕ represents the bitwise XOR operation. Find the minimum number of operations required to convert the given string into a palindrome. Input Format Xor Palindrome solution codechef First line of the input contains TT, the number of … Read more