← Roadmapsall dynamic programming problems
📐

Dynamic Programming

Sequences, grids, knapsack, string DP, state machines.

6 subtopics · 129 problems0/90 on the path solved
next ▸ Fibonacci Numbermachine 1000
01

1D & climbing

0/16 of 25

Stairs, robber, tribonacci, min cost.

02

Sequences (LIS)

0/10

Longest increasing, arithmetic, pair chains.

03

Grid paths

0/16 of 21

Unique paths, min path sum, falling path.

04

Knapsack & subset

0/16 of 31

Partition, target sum, coin change.

05

String DP

0/16 of 18

LCS, edit distance, palindromic subseq.

06

Stock & intervals

0/16 of 24

Buy/sell, cooldown, job scheduling.