A

Admin • 831.35K Points
Coach

Q. Which of the following problems should be solved using dynamic programming?

  • (A) mergesort
  • (B) binary search
  • (C) longest common subsequence
  • (D) quicksort
Explanation by: Admin
the longest common subsequence problem has both, optimal substructure and overlapping subproblems. hence, dynamic programming should be used the solve this problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.