Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1682. Longest Palindromic Subsequence II
Given a string, find the length of the longest palindromic subsequence you can form (a subsequence that reads the same forward and backward). This typically requires interval DP or memoized recursion comparing characters from both ends to compute the optimal subsequence length in O(n^2) time and space.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.