← Back to All Algorithms

🪙 Coin Change (Minimum Coins)

Problem

Find the minimum number of coins needed to make a target amount.

Recurrence: dp[i] = min(dp[i], 1 + dp[i - coin]) for each coin

Available Coins

Target Amount: 11
Click "Start" to find minimum coins

Solution Found!

Minimum coins:

Coins used: