Q166
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
AnswerC.
Coin change problem
D.
Knapsack problems
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board