1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Which of the following problems can be u...
Q.

Which of the following problems can be used to solve the minimum number of insertions to form a palindrome problem?

A. minimum number of jumps problem
B. longest common subsequence problem
C. coin change problem
D. knapsack problems
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.

Discussion