Here is the interview question prompt, presented for reference.
palindrome is a word, phrase, or sequence that reads the same backward or forwards. A
palindromic subsequence is a palindrome derived from a sequence by deleting some or no elements from it. This subsequence is formed without changing the order of the elements in the original sequence.
Given a string
s, can you find the length of the longest palindromic subsequence of
For example, if
s = "bbbab", then the longest palindromic subsequence is
bbbb. The length of this subsequence is
4, which is the required answer.
sconsists only of lowercase English letters.
You can see the full challenge with visuals at this link.
Challenges • Asked 4 months ago by Jake from AlgoDaily
This is the main discussion thread generated for Length of Longest Palindromic Subsequence (Main Thread).