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
I have been asked this question during an interview.
My enquiry is from Minimum Insertions to form a Palindrome topic in section Dynamic Programming of Data Structures & Algorithms II