🙏

জয়  শ্রী  রাম

🕉

---

Problem Statement:

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

Solution:

Pre-requisites:

• 1-String DP
• Palindrome
• Longest Palindromic Substring

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

Instructor: