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?
|D.||both recursion and dynamic programming|
|Answer» D. both recursion and dynamic programming|
|Explanation: dynamic programming and recursion can be used to solve the problem.|
Login to Continue
It will take less than 2 minutes