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?

M

Mr. Dubey

🎓 Coach ⭐ 103.80K Points

📊 Design and Analysis of Algorithms

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

💬 Discuss

✅ Correct Answer: (D) both recursion and dynamic programming

Explanation: dynamic programming and recursion can be used to solve the problem.

Explanation by: Mr. Dubey

dynamic programming and recursion can be used to solve the problem.

💬 Discussion

📊 Question Analytics

👁️

720

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

98%

Success Rate