InterviewForge

Coin Change — Interview Guide

The classic unbounded-knapsack DP for Coin Change, with the greedy-fails discussion and the BFS shortest-path framing.

Updated 2026-09MediumDynamic Programming

The problem

Given coin denominations and an amount, return the fewest number of coins needed to make that amount, or -1 if it is impossible.

Unlock the full guide

Premium members get every DSA, system design, company and role interview guide — plus AI practice, mock interviews, and analytics.

Unlock with Premium