Concepts5

The Longest Common Subsequence (LCS) between two sequences is the longest sequence that appears in both, not necessarily contiguously.

Edit distance (Levenshtein distance) measures the minimum number of inserts, deletes, and replaces needed to turn one string into another.

Knapsack problems ask how to pick items under a weight (or cost) limit to maximize value or to check if a target sum is reachable.

Dynamic programming (DP) solves complex problems by breaking them into overlapping subproblems and using their optimal substructure.

Dynamic Programming (DP) state design is the art of choosing what information to remember so that optimal substructure can be reused efficiently.