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
related to the classical problem.
@iwandepe This is not Longest palindromic subsequence problem. It's similar to that problem but not same. Pls don't confuse people.Last edit: 2021-05-28 10:53:35
Longest palindrome subsequent problem
top down also worksLast edit: 2021-04-28 04:10:38
AC in one go, ez peez dp
dont forgot to add '\n' in each test case
dont know why top down doesnt work. iterative bottom up works like a charm
did anybody get AC with python?
Nice DP problem , understand the problem "Longest palindromic sub sequence", just modification to equation and there you have it.. smoking bottom up DP solution
good DP problem