A

Admin • 831.35K Points
Coach

Q. Which of the following methods can be used to solve the longest common subsequence problem?

  • (A) recursion
  • (B) dynamic programming
  • (C) both recursion and dynamic programming
  • (D) greedy algorithm
Explanation by: Admin
both recursion and dynamic programming can be used to solve the longest subsequence problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.