Dynamic Programming
← All learning paths
Build from one-dimensional recurrences to subsequences, segmentation, and two-dimensional state.
Outcome: Define state, transitions, base cases, and space optimizations with confidence.
Recommended first: Arrays & Strings
Module 1: One-dimensional State
Start with small recurrences and rolling state.
0/4
Module 2: Choices & Segmentation
Compare competing decisions and reusable suffixes.
0/3
Module 3: Two-dimensional State
Coordinate two indices or ranges.
0/3
