S+

1D DP Basic

0 / 8

70Climbing Stairs1D DP basics746Min Cost Climbing Stairs1D DP basics1137N-th Tribonacci Number1D DP basics198House RobberLinear DP213House Robber IICircular DP91Decode WaysState transition (nail edge cases)152Maximum Product SubarrayTwo-state DP139Word BreakString partition DP

A

Knapsack

0 / 10

322Coin ChangeUnbounded Knapsack416Partition Equal Subset Sum0/1 Knapsack377Combination Sum IVUnbounded Knapsack (permutation)279Perfect SquaresUnbounded Knapsack343Integer BreakUnbounded Knapsack518Coin Change IIUnbounded Knapsack (combination)494Target Sum0/1 Knapsack variant1049Last Stone Weight II0/1 Knapsack variant474Ones and ZeroesMulti-dimensional Knapsack983Minimum Cost For TicketsDecision Knapsack

A+

String DP(LCS / Edit Distance)

0 / 5

5Longest Palindromic SubstringExpand around center647Palindromic SubstringsInterval DP1143Longest Common SubsequenceLCS classic72Edit DistanceString DP classic516Longest Palindromic SubsequenceInterval DP

A

Sequence / LIS DP

0 / 3

300Longest Increasing SubsequenceLIS basics (know O(n log n) version)673Number of Longest Increasing SubsequenceLIS counting1235Maximum Profit in Job SchedulingSort + DP + binary search

A+

Grid DP

0 / 6

62Unique PathsGrid DP basics63Unique Paths IIGrid DP + obstacles64Minimum Path SumGrid DP classic221Maximal SquareMatrix DP classic1937Maximum Number of Points with CostGrid DP + optimization329Longest Increasing Path in a MatrixDFS + memoization

ViewEdit