Dynamic Programming
Break complex problems into overlapping subproblems and build up optimal solutions.
0/1 Knapsack
Maximizes value from items placed in a weight-limited knapsack.
Longest Common Subsequence
Finds the longest subsequence common to two sequences.
Maximum Subarray
Finds the contiguous subarray with the largest sum using Kadane's algorithm.