A

Admin • 833K Points
Coach

Q. The Knapsack problem is an example of

  • (A) greedy algorithm
  • (B) 2d dynamic programming
  • (C) 1d dynamic programming
  • (D) divide and conquer

Explanation by: Admin

knapsack problem is an example of 2d dynamic programming.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.