Problem Statement:

Given a string return the length of the longest palindromic subsequence.



This problem is another great example of how the template discussed in the chapter 1-String DP can be used to solve problems of all difficulty levels.

I have discussed the algorithm in the inline comments in the code below:

Java Code:

Login to Access Content

Python Code:

Login to Access Content


If you have any feedback, please use this form:

Help Your Friends save 25% on our products