Skip to main content

Longest Palindromic Subsequence

Learn Longest Palindromic Subsequence (Dynamic Programming, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

LCS of a String and Its Own Reverse The cleanest way to see this problem: the Longest Palindromic Subsequence of a string equals the Longest Common Subsequence between that string and its REVERSE. Any common subsequence between a string and its reverse reads the same forward and backward - by definition, a palindrome.

More lessons in Dynamic Programming