Coin Change II Counting Combinations (Practice 5044): Rehearsal

Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.

Approach

Loop coins on the outside so each combination is counted once regardless of order.

def change(amount,coins):
    dp=[1]+[0]*amount
    for c in coins:
        for x in range(c,amount+1): dp[x]+=dp[x-c]
    return dp[amount]

Complexity

Linear in the dominant input size for the scan; heap/tree variants add a log factor.

Interview pitfalls

State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.

Practicing out loud

Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see learn more.