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

(A) true
(B) false
(C) ---
(D) ---

💬 Discuss

✅ Correct Answer: (A) true

Explanation: a single character of any string can always be considered as a palindrome and its length is one.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

a single character of any string can always be considered as a palindrome and its length is one.

💬 Discussion

📊 Question Analytics

👁️

872

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

81%

Success Rate