Longest Palindromic Subsequence Dynamic Programming

Coding Interview Question:- Given a string S, Find the length of the longest palindromic subsequence. Example:- S = "LPASPAL" length of the LPS = 5 ("LPSPL"). This video explains the Dynamic Programming approach to solve the Longest Palindromic Subsequence problem. Source code: http://www.ideserve.co.in/learn/longe... Website: http://www.ideserve.co.in Facebook:   / ideserve.co.in