AIBOHP  Aibohphobia
BuggyD suffers from AIBOHPHOBIA  the fear of Palindromes. A palindrome is a string that reads the same forward and backward.
To cure him of this fatal disease, doctors from all over the world discussed his fear and decided to expose him to large number of palindromes. To do this, they decided to play a game with BuggyD. The rules of the game are as follows:
BuggyD has to supply a string S. The doctors have to add or insert characters to the string to make it a palindrome. Characters can be inserted anywhere in the string.
The doctors took this game very lightly and just appended the reverse of S to the end of S, thus making it a palindrome. For example, if S = "fft", the doctors change the string to "ffttff".
Nowadays, BuggyD is cured of the disease (having been exposed to a large number of palindromes), but he still wants to continue the game by his rules. He now asks the doctors to insert the minimum number of characters needed to make S a palindrome. Help the doctors accomplish this task.
For instance, if S = "fft", the doctors should change the string to "tfft", adding only 1 character.
Input
The first line of the input contains an integer t, the number of test cases. t test cases follow.
Each test case consists of one line, the string S. The length of S will be no more than 6100 characters, and S will contain no whitespace characters.
Output
For each test case output one line containing a single integer denoting the minimum number of characters that must be inserted into S to make it a palindrome.
Example
Input: 1 fft Output: 1
hide comments
shikhar jindal:
20150401 06:25:10
can anyone provide me with some tricky test cases........


prakhar:
20150328 14:17:25
I am doing memoization for the question. Complexity for each test case is n^2. It's giving TLE. Can anybody tell me the reason for the same ??


785227:
20150303 16:46:31
@ akhil appana, Yes 

codedog:
20150203 14:43:57
can the insertion be done at any position? 

Darren Sun:
20140726 08:25:13
With optimizations in the complexity (O(n^2) time and O(3*6100) space) and I/O, I made it ~4s with Java (after many TLEs, of course). I also realized how costly modulo operations could be...


Shaily Mittal:
20130522 16:59:55
why use of array of size 6101*6101 gives Segmentation fault while Memory limit is 256 MB?

Added by:  Matthew Reeder 
Date:  20061029 
Time limit:  1.940s 
Source limit:  30000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  AlKhawarizm 2006 