Q224
For every non-empty string, the length of the longest palindromic subsequence is at least one.
A.
True
AnswerB.
False
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board