LeetCode 322: Coin Change

[github-actions]

LeetCode 322: Coin Change

Category: Dynamic Programming
Difficulty: See LeetCode
Solution File: src/dynamic_programming/coin_change.py
Test File: tests/test_coin_change.py

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. If that amount of money cannot be
made up by any combination of the coins, return -1.
You may assume that you have an infinite number of each kind of coin.

Example 1:
Input: coins = [1,2,5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1

Example 2:
Input: coins = [2], amount = 3
Output: -1

Constraints:

• 1 <= coins.length <= 12
• 1 <= coins[i] <= 2^31 - 1
• 0 <= amount <= 10^4

Tasks

• Implement the solution in src/dynamic_programming/coin_change.py
• Ensure all test cases pass
• Analyze time complexity
• Analyze space complexity