# dynamic programming

Mar
17

## Partition Problem

A special case of Subset Problem
Mar
17

## Subset Sum Problem

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

Mar
11

## The Coin Change Problem

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