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
rajesh9315:
20210723 11:17:14
related to the classical problem. 

yasser1110:
20210528 10:46:19
@iwandepe This is not Longest palindromic subsequence problem. It's similar to that problem but not same. Pls don't confuse people. Last edit: 20210528 10:53:35 

iwandepe:
20210124 11:19:22
Longest palindrome subsequent problem 

shreyas_07:
20201121 16:46:33
top down also works Last edit: 20210428 04:10:38 

kxbaphomet_666:
20201113 21:44:03
AC in one go, ez peez dp 

wrxld:
20201010 08:46:50
dont forgot to add '\n' in each test case 

varuntumbe:
20200926 07:46:04
dont know why top down doesnt work. iterative bottom up works like a charm


yash_490:
20200915 13:04:15
did anybody get AC with python?


saurabh_shinde:
20200914 21:16:04
Nice DP problem , understand the problem "Longest palindromic sub sequence", just modification to equation and there you have it.. smoking bottom up DP solution 

petr_ivashkov:
20200825 10:19:48
good DP problem 
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 