← Questions
Longest palindromic subsequence
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return the length of the longest subsequence of a string that reads the same forwards and backwards. Give the interval dynamic programming and its O(n^2) time.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Write and test your solution herePython in your browser, the question's tests level by level, saved for you.Sign in to start coding