Q. 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?

• Dynamic programming
• Greedy algorithm
• Recursion
• Both recursion and dynamic programming

Submit