Skip to content

Dynamic Programming (DP)

Roberto Fronteddu edited this page Feb 9, 2026 · 1 revision

When: Overlapping subproblems Sub-patterns:

0/1 Knapsack

Unbounded Knapsack

Fibonacci

Coin change

Longest common subsequence

Longest increasing subsequence

Clone this wiki locally