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|
|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.|
Login to Continue
It will take less than 2 minutes