Geeksforgeeks

Error

Given a value N, find the number of ways to make change for N cents, if we have infinite supply of each of S = { S_{1}, S_{2}, .. , S_{M }} valued coins.

**Example 1:**

**Input:**
n = 4 , m = 3
S[] = {1,2,3}
**Output:** 4
**Explanation**: Four Possible ways are:
{1,1,1,1},{1,1,2},{2,2},{1,3}.

**Example 2:**

**Input**:
n = 10 , m = 4
S[] ={2,5,3,6}
**Output:** 5
**Explanation**: Five Possible ways are:
{2,2,2,2,2}, {2,2,3,3}, {2,2,6}, {2,3,5}
and {5,5}.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **count() **which accepts an array **S[] **its size **m **and **n** as input parameter and returns the number of ways to make change for N cents.

**Expected Time Complexity: **O(m*n).

**Expected Auxiliary Space: **O(n).

**Constraints:**

1 <= n,m <= 10^{3}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Coin Change

...