droot / coin_change

Solution to coin change problem in python

A quick implementation of coin change problem.

Problem Statement: Given a unlimited coins of a few kinds e.g. 1 cent, 10 cent etc. find a minimum number of coins needed to render a change for an amount n cents