Search
⌘K
Leetcode 518. Coin Change II
Given unlimited coins of specified denominations, count how many distinct combinations (order irrelevant) sum to a target amount. This is a classic unbounded knapsack / DP counting problem to compute the number of ways to make the amount.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early April, 2025
Mid-level
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.