Skip to content
ı
Workspace
Visualizer
Search anything…
⌘ K
Desk
Path
Problems
Review
More
Library
/
Coin Change (Minimum Coins)
dynamic programming
Best
O(n · amount)
Avg
O(n · amount)
Worst
O(n · amount)
Space
O(amount)
Preparing Coin Change (Minimum Coins)...
Builds optimal minimum coin counts for every intermediate sub-amount up to the target amount.