Please enter your email address or userHandle.
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
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.