A

Admin • 833K Points
Coach

Q. You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using

  • (A) greedy algorithm
  • (B) dynamic programming
  • (C) divide and conquer
  • (D) backtracking

Explanation by: Admin

the coin change problem has overlapping subproblems(same subproblems are solved multiple times) and optimal substructure(the solution to the problem can

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.