Skip to content

coin-change #4

Description

@skywalkerluc

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.

You can have more information at src/coin-change/problem.md

Feel free to add questions here.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions