Suppose you are given infinite coins of N 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. What is the space complexity of a dynamic programming implementation used to solve the coin change problem?

Suppose you are given infinite coins of N 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. What is the space complexity of a dynamic programming implementation used to solve the coin change problem? Correct Answer O(S)

To get the optimal solution for a sum S, the optimal solution is found for each sum less than equal to S and each solution is stored. So, the space complexity is O(S).

Related Questions

The question below is followed by two statements I and II. You have to determine whether the data given is sufficient for answering the question. You should use the data and your knowledge of mathematics to choose the best possible answer.  Belly has some coins out of which some are of 25 Cent and Some are of 50 Cent. If he has a total of 250 coins, how many coins does he have of 25 Cent? I) Belly has three times as many as 50 Cent coins as 25 Cent coins. II) Belly has 20 more 25 cent coins than the 50 Cent coin.