![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-white.png)
McqMate
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? |
A. | greedy algorithm |
B. | recursion |
C. | dynamic programming |
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. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet