Dynamic Programming (DP) - rFronteddu/general_wiki GitHub Wiki
When: Overlapping subproblems Sub-patterns:
0/1 Knapsack
Unbounded Knapsack
Fibonacci
Coin change
Longest common subsequence
Longest increasing subsequence
When: Overlapping subproblems Sub-patterns:
0/1 Knapsack
Unbounded Knapsack
Fibonacci
Coin change
Longest common subsequence
Longest increasing subsequence