ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
Which of the following problems can be used to solve the minimum number of insertions to form a palindrome problem?
Correct Answer: B — Longest common subsequence problem
A variation of longest common subsequence can be used to solve the minimum number of insertions to form a palindrome problem.