Implement `coinChange(coins, amount)` returning the fewest number of coins needed to make `amount`, or `-1` if it cannot be made.
+ 1 hidden test run on Submit.
Bottom-up DP over amounts gives the minimum coins in O(amount * coins) time.
Run your code to see results.