Skip to main content
Dynamic Programming1 article

Dynamic Programming

Dynamic programming turns exponential brute-force into polynomial time by caching subproblem answers. The hardest pattern to recognize — but the most rewarding.

DP stops being scary when you name the state

DP is a compression problem, not a recursion trick. Ask one question — what does the future need to know from the past? — and state, recurrence, and iteration order fall out. Here are the engineers and open textbooks that teach it.

Fin · Apr 17, 2026

Practice Dynamic Programming problems

Coin ChangeMDecode WaysMGenerate ParenthesesMHouse RobberM
All Dynamic Programming problems