Coin Change
← Back to Classic Problems (DP)
Given coin denominations and a target amount, find the minimum number of coins needed (or the number of ways to make change). Solved with DP in O(n * amount) time. A classic example demonstrating both optimization and counting DP formulations.