## Subset Sum Problem

A special case of 0/1 Knapsack Problem Given a finite set \(S = \{ s \in \mathbb{Z}_+\}\) and an integer

## The Coin Change Problem

The coin change problem is a classic dynamic programming problem (unbounded knapsack problem) which can be solved recursively. N = Coins