Closed Surajvatsya closed 3 years ago
Explain the code and add complexities and examples as well in the comments.
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
Please reopen this issue once you commit the changes requested or make improvements on the code. Thank you for your contributions.
Have you read the Contributing Guidelines on Pull Requests?
yes
Description
Given a value N, find the number of ways to make change for N cents, if we have an infinite supply of each of S = { S1, S2, .. , SM } valued coins.
Checklist
Related Issues or Pull Requests
906
Fill up the DCP form
If you are a part of DCP 21, fill up this form after the PR is merged.
The links provided in the form will be checked thoroughly, if someone tries fooling around, strict actions will be taken against the individual.