Loading practice questions
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
Explanation:
A variation of longest common subsequence can be used to solve the minimum number of insertions to form a palindrome problem.