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
| mohamadhegazy97 | 57 |
| ManojBharadhwaj | 49 |
| bhatabhi554 | 48 |
| adityak12 | 48 |
| RaghavJindal | 47 |
| blackshadows | 940 |
| SunkyuHwang | 794 |
| bently_nixon | 701 |
| mb1973 | 491 |
| Shaurya Khanna | 491 |
| akhayrutdinov | 5043 |
| Ibrahim Nash | 4967 |
| blackshadows | 4640 |
| Quandray | 4354 |
| sanjay05 | 3668 |