Some error occured while loading page for you. Please try again.
James found a love letter that his friend Harry has written to his girlfriend. James is a prankster, so he decides to meddle with the letter. He changes all the words in the letter into palindromes.
To do this, he follows two rules:
Each reduction in the value of any letter is counted as a single operation. Find the minimum number of operations required to convert a given string into a palindrome.
The first line contains an integer , the number of queries.
The next lines will each contain a string .
length of string
All characters are lower case English letters, no spaces.
A single line containing the number of minimum operations corresponding to each test case.