Search
⌘K
Leetcode 516. Longest Palindromic Subsequence
Find the length of the longest subsequence of s that reads the same forwards and backwards — a classic dynamic programming problem (equivalently LCS between s and its reverse) typically solved in O(n^2) time and O(n^2)/O(n) space for n ≤ 1000.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.