Q194
Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?
A.
Greedy algorithm
B.
Recursion
C.
Dynamic programming
D.
Both recursion and dynamic programming
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board