Q. For every non-empty string, the length of the longest palindromic subsequence is at least one.
✅ Correct Answer: (A)
true
Explanation: a single character of any string can always be considered as a palindrome and its length is one.