Coin Change (Extra) Problem

Coin Change (Extra) Problem — ExecCode Medium DSA Practice

Solve the Coin Change (Extra) problem on ExecCode. Free online medium DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Coin Change (Extra): Unbounded knapsack For Coin Change (Extra), focus on the exact input variables, return only the requested value, and preserve the required time complexity for the intended pattern.

Examples

Input coins = [1, 2, 5], amount = 11; Output 3

Constraints

1 ≤ n ≤ 10^4

Practice Coin Change (Extra) free on ExecCode. Browse DSA problems, topic map, and placement guides.