Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Longest Palindromic Subsequence
Coding · Dynamic Programming · String
- Longest Palindromic Subsequence After at Most K Operations
Coding
- Length of Longest Fibonacci Subsequence
Coding
- Length of the Longest Subsequence That Sums to Target
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1682. Longest Palindromic Subsequence II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source