Q.

For every non-empty string, the length of the longest palindromic subsequence is at least one.

A. true
B. false
Answer» A. true
Explanation: a single character of any string can always be considered as a palindrome and its length is one.
2.3k
0
Do you find this helpful?
1

Discussion

No comments yet