# Find the Minimum Number of Coins Needed to Make Change
solved by 891

## The Change Problem

*Find the minimum number of coins needed to make change.*

Given: An integer *money* and an array *Coins* of positive integers.

Return: The minimum number of coins with denominations *Coins* that changes *money*.

## Sample Dataset

## Sample Output

Please login to solve this problem.