Given a String, find the longest palindromic subsequence
Input:
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)
Output:
Print the Maximum length possible for palindromic subsequence.
Constraints:
1<=T<=100
1<=|Length of String|<=1000
Examples:
Input:
2
bbabcbcab
abbaab
Output:
7
4
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.
| geetyadav | 82 |
| hari32147 | 76 |
| AdityaRaj9 | 75 |
| yashrana1 | 74 |
| amitpandey19 | 67 |
| abducodes | 850 |
| harshtyagi36 | 417 |
| vamsikrishna55 | 323 |
| sandipbhaumik | 321 |
| Akhil varma | 314 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4567 |