Timer is Running

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

Example 1:

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

Example 2:

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). 

1 <= n,m <= 103


** For More Input/Output Examples Use 'Expected Output' option **

Author: shef5

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.