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.
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.
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.
Input: 1 fft Output: 1
AC in many go
simple dp problem . Pass string by reference else TLE
Use an array instead on multi_map as memo table for top down dp
Very nice problem. Can be solved by simple DP using bottom-up approach/top-down without LCS. One of those problems that are stepping stones to DP skill.
Traceback (most recent call last):
can be solved without lcs,just apply condition of pallindrome.don't forgot to declare string as char s;cost me tle,use printf and scanf,size of dp
Accepted in one go. Easily can solve using LCS, but how to solve without LCS?
1-it can be solved without LCS
check 1 length string too..