feat: Coin Change

Author: HodaeSsi

coin-change/HodaeSsi.py

@@ -0,0 +1,17 @@
+# space complexity: O(n) (여기서 n은 amount)
+# time complexity: O(n * m) (여기서 n은 amount, m은 coins의 길이)
+from typing import List
+
+
+class Solution:
+    def coinChange(self, coins: List[int], amount: int) -> int:
+        dp = [float('inf')] * (amount + 1)
+        dp[0] = 0
+        
+        for i in range(1, amount + 1):
+            for coin in coins:
+                if coin <= i:
+                    dp[i] = min(dp[i], dp[i - coin] + 1)
+        
+        return dp[amount] if dp[amount] != float('inf') else -1
+