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.
| murli01 | 343 |
| decoder_101 | 216 |
| Sulagna | 189 |
| kya_bolti_public | 172 |
| madhursengar24 | 172 |
| PiyushPandey4 | 717 |
| john_wick | 681 |
| ASWATHAMA | 565 |
| akhyasharma01 | 547 |
| jagrit_ | 507 |
| blackshadows | 5362 |
| Ibrahim Nash | 5242 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4598 |