Longest Palindromic Subsequence

• Algorithms and Data Structures: TheAlgorist.com
  
• System Design: DistributedComputing.dev
  
• Low Level Design: LowLevelDesign.io
  
• Frontend Engineering: FrontendEngineering.io
  

---

Help Your Friends save 40% on our products

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:

This is a Premium content.
Please subscribe to Algorithms course to access the code.

Python Code:

This is a Premium content.
Please subscribe to Algorithms course to access the code.

Instructor:

If you have any feedback, please use this form: https://thealgorists.com/Feedback.

---

Help Your Friends save 40% on our products