A

Admin • 833K Points
Coach

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

  • (A) dynamic programming
  • (B) recursion
  • (C) brute force
  • (D) dynamic programming, recursion, brute force

Explanation by: Admin

dynamic programming, recursion, brute force can be used to solve the longest palindromic subsequence problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.