Y
YeetCode
Dashboard
/
1-D Dynamic Programming
/
Coin Change
Medium
#322
Unbounded Knapsack
Coin Change
Find the fewest coins needed to make a target amount.
Solve on LeetCode
↗
Full Explanation
Previous
← Palindromic Substrings
Next
Word Break →