Medium Problemspalindromestringinterval
Longest Palindromic Subsequence
Given a string, find the length of the longest subsequence of its characters that reads the same forwards and backwards. The chosen characters must keep their original order but need not be adjacent.
Do this lesson first: longest common subsequenceThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.