Given a String, find the longest palindromic subsequence
The first line of input contains an integer T, denoting no of test cases. The only line of each test case consists of a string S(only lowercase)
Print the Maximum length possible for palindromic subsequence.
1<=|Length of String|<=1000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.