The coin change problem asks how denominations can form a target amount. Common versions minimize the number of coins, count unordered combinations, or count ordered sequences; these are different problems.
For positive integer denominations, the minimum-count recurrence is and , using infinity for unreachable amounts. For denominations and target six, the optimum is , whereas a largest-first greedy rule gives .
New to topics? Read the docs here!