solulubeta
Sign in
NeetCode 150 / 1-D Dynamic Programming
13.08 · Problem

Coin Change

Medium Unbounded knapsack (min coins) 1 video LC 322 Pro

This problem is part of solulu Pro

Given coin denominations (unlimited supply of each) and an amount, return the fewest coins that add up to the amount, or -1 if it can't be made.

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 106 of 150 · updated 2026-10-12