Q60
Which of the following methods can be used to solve the longest palindromic subsequence problem?
A.
Dynamic programming
B.
Recursion
C.
Brute force
D.
Dynamic programming, Recursion, Brute force
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board