Longest Palindrome Subsequence Problem

Longest Palindrome Subsequence Problem — ExecCode Medium DSA Practice

Solve the Longest Palindrome Subsequence problem on ExecCode. Free online medium DSA practice in String. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description Given a string s, find the longest palindromic subsequence's length in s. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements. Examples Example 1 Input: s = "bbbab" Output: 4 Explanation: One possible longest palindromic subsequence is "bbbb". Example 2 Input: s = "cbbd" Output: 2 Explanation: One possible longest palindromic subsequence is "bb". Constraints 1 <= s.length <= 1000 s consists only of lowercase English letters.

Examples

Input s = "bbbab"; Output 4. Input s = "cbbd"; Output 2

Constraints

1 <= s.length <= 1000 s consists only of lowercase English letters.

Practice Longest Palindrome Subsequence free on ExecCode. Browse DSA problems, topic map, and placement guides.