Coin Change
#322
Medium
Dynamic Programming
O(amount * coins)
O(amount)
Amazon
Microsoft
Facebook
Uber
Problem Description
You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coins that you need to make up that amount.