In the worst case, the minimum number of insertions to be made to convert the string into a palindrome is equal to the length of the string.

🎓 Coach ⭐ 104.48K Points

📊 Design and Analysis of Algorithms

Q. In the worst case, the minimum number of insertions to be made to convert the string into a palindrome is equal to the length of the string.

(A) true
(B) false
(C) answer: b
(D) explanation: in the worst case, the minimum number of insertions to be made to convert the string into a palindrome is equal to length of the string minus one. for example, consider the string “abc”. the string can be converted to “abcba

💬 Discuss

✅ Correct Answer: (B) false

Explanation: the string can be converted to “efgfe” by inserting “f” or to “egfge” by inserting “g”. thus, only one insertion is required.

the string can be converted to “efgfe” by inserting “f” or to “egfge” by inserting “g”. thus, only one insertion is required.

💬 Discussion

👁️

976

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

80%

Success Rate