Leetcode 322. Coin Change
Given coin denominations available in unlimited quantity and a target amount, find the minimum number of coins needed to form that amount (return -1 if impossible). This is a classic unbounded knapsack / shortest-path-on-integer-states problem (amount ≤ 10^4, up to 12 coin types).
Asked at:
Amazon
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Early November, 2025
Amazon
Junior
Find the minimum number of coins required to make a specific target amount, given a set of coin denominations and an infinite supply of each coin. If the amount cannot be made with the given coins, the result is -1
Mid April, 2025
Amazon
Mid-level
Late September, 2024
Mid-level
Reverse coin change: Given a 1D DP array, find minimum coins required to make that amount
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.