Loop

2-D Dynamic Programming

Two shrinking dimensions: string alignment, knapsacks, grids, and interval DP.

0 of 6 lessons complete · 167 min total

Start module
  1. Two Dimensions: LCS, Knapsack, Edit DistanceWhen two independent quantities shrink toward base cases — two string prefixes, items-plus-capacity, or grid coordinates — and how the three feeder cells (top, left, diagonal) encode the choices.Lesson · 18 minNot completed
  2. The Grid Fills InWatching a 2-D table compute and then reveal its answer path.Animation · 10 minNot completed
  3. Practice: Grids & Two StringsPath counting, the classic LCS table, state-machine stock DP, and combination-counting knapsack.medium×44 problems · 0 solvedPractice · 40 minNot completed
  4. Practice: Prefix & Memo DPOffset subset-sums, dual-prefix interleaving, Levenshtein distance, and per-cell memoized DFS.medium×3hard4 problems · 0 solvedPractice · 45 minNot completed
  5. Practice: Hard Counting & IntervalsSubsequence-match counting, last-balloon interval DP, and star-branch regex matching.hard×33 problems · 0 solvedPractice · 45 minNot completed
  6. 2-D DP CheckpointTable orientation, feeder-cell meaning, interval DP framing, and rolling-row space cuts.Checkpoint · 9 minNot completed