• Home
  • Learn
  • Feed
  • Ladder
  • Saved
← Roadmapsall dynamic programming problems
📐

Dynamic Programming

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

7 stops · 248 problems0/106 on the path done
next ▸ Fibonacci NumberSilver · 1000
1

1D & climbing

0/16 of 28you are here

Stairs, robber, tribonacci, min cost.

○Fibonacci Number○Climbing Stairs○Tribonacci Number○N-th Tribonacci Number○Minimum Cost Climbing Stairs○Paint House Minimum Cost○House Robber○Paint Fence○Max Non-Adjacent Sum○Climbing Stairs (K Steps)○Min Cost Climbing Stairs○Paint Fence Ways○Minimum Cost to Paint Houses○Paint House○Hop One Two Three○House Robber II (Circular)+12 in the arena
2

Sequences (LIS)

0/10

Longest increasing, arithmetic, pair chains.

○Longest Arithmetic Subsequence of Given Difference○Longest String Chain Length○Maximum Sum Increasing Subsequence○Longest String Chain○Longest Increasing Subsequence○Longest Arithmetic Subsequence○Russian Doll Envelopes○Number of Longest Increasing Subsequences○Longest Bitonic Subsequence○Count Arithmetic Subsequences
3

Grid paths

0/16 of 22

Unique paths, min path sum, falling path.

○Unique Paths○Minimum Path Sum○Triangle Minimum Total○Unique Paths II○Unique Paths in a Grid○Triangle Minimum Path Sum○Minimum Falling Path Sum○Minimum Total Path In Triangle○Triangle Minimum Path○Unique Paths With Obstacles○Triangle○Maximal Square○Minimum Falling Path Sum II○Triangle Descent Cost○Dungeon Game Minimum Health○Dungeon Game+6 in the arena
4

Knapsack & subset

0/16 of 31

Partition, target sum, coin change.

○Perfect Squares○Number of Dice Rolls With Target Sum○Coin Change: Number of Ways○Coin Change○Coin Change Minimum Coins○Maximum Alternating Subsequence Sum○Equal Subset Partition○Rod Cutting Max Revenue○Dice Rolls With Target Sum○0/1 Knapsack Max Value○Coin Change II○Coin Change (Min Coins)○Partition Equal Subset Sum○Coin Change Minimum○Coin Change Ways○Target Sum+15 in the arena
5

String DP

0/16 of 18

LCS, edit distance, palindromic subseq.

○Maximum Length of Repeated Subarray○Longest Palindromic Subsequence○Minimum Insertions to Make Palindrome○Longest Palindromic Substring Length○Insertions to Palindrome○Max Repeated Subarray○Word Break (Count Ways)○Minimum Insertions to Make a Palindrome○Longest Common Subsequence○Word Break○Distinct Subsequences Count○Edit Distance○Count Palindromic Subsequences○Distinct Subsequences (mod 1e9+7)○Wildcard Matching○Count Distinct Palindromic Subsequences+2 in the arena
6

Stock & intervals

0/16 of 24

Buy/sell, cooldown, job scheduling.

○Predict the Winner Score Difference○Best Time to Buy and Sell Stock with Fee○Stock Trading with Fee○Best Time to Buy and Sell With Transaction Fee○Stock Trading with Cooldown○Best Time to Buy and Sell With Cooldown○Predict The Winner (Score Difference)○Maximum Profit in Job Scheduling○Best Time to Buy and Sell Stock (Two Transactions)○Predict the Winner Difference○Minimum Difficulty of a Job Schedule○Filling Bookcase Shelves○Best Time to Buy and Sell With At Most Two Transactions○Stone Game VII○Best Time to Buy and Sell Stock with Cooldown○Stone Game+8 in the arena
7

More Dynamic Programming

0/16 of 115

Everything else in this category — keep climbing.

○Count Vowel Permutations○Minimum Moves to Equal Array Elements○Equal Sum Split Points○Count Ways To Reach Score○Minimum Cost Path in Grid○Maximum Points Moving Right or Down○Domino Tiling Count○Maximum Sum of Non-Adjacent Elements○Integer Break○Count Palindromic Substrings○Shortest Common Supersequence Length○Number of Ways to Stay in the Same Place○Unique Grid Paths○Maximum Subarray○Longest Mountain in Array○Maximum Points From Cards+99 in the arena
🏁Finish line