322. Coin Change - LeetCode Solution

class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:
        
        dp = [amount+1] * (amount+1)
        
        dp[0] = 0
        
        for i in coins:
            for j in range(i, amount+1):
                dp[j] = min(dp[j], dp[j - i] +1)
        if dp[-1] == amount+1:
            return -1
        else:
            return dp[-1]