Problem · String
Longest Palindromic Subsequence
Learn this problemProblem statement
Given a string s, return the length of its longest subsequence that reads the same from left to right and right to left.
A subsequence keeps the relative order of selected characters but does not need to use contiguous positions.
Function
longestPalindromeSubseq(s: String) → intExamples
Example 1
s = "bbbab"return = 4One longest palindromic subsequence is bbbb.
Example 2
s = "cbbd"return = 2