NeetCode #717LC-516Medium2-D Dynamic Programming
← Back to All Problems#717 · #516 · Longest Palindromic Subsequence(最长回文子序列)
📌 Problem Statement & Constraints
Given a string
s, return the length of its longest palindromic subsequence. Constraints: 1 <= s.length <= 1000, and s consists of lowercase English letters.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!