30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

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:

Google

Amazon

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid April, 2025

Amazon

Mid-level

Late September, 2024

Google

Mid-level

Reverse coin change: Given a 1D DP array, find minimum coins required to make that amount

Late September, 2024

Google

Mid-level

Coin change problem: Find minimum number of coins to make a given amount

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 322. Coin Change

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact