60 Dynamic Programming Challenges
Core DP Basics
10 GamesKnapsack Family
8 GamesLongest Sequences
14 GamesGrid DP
6 GamesBitmask DP
4 GamesTree DP
5 GamesDigit DP
3 GamesAdvanced Contest DP
7 GamesMisc DSA Problems
9 GamesFibonacci DP - DP[i] = DP[i-1] + DP[i-2]
Climbing Stairs - ways[i] = ways[i-1] + ways[i-2]
Min Cost Climbing - DP[i] = min(DP[i-1], DP[i-2]) + cost[i]
House Robber - dp[i] = max(dp[i-1], dp[i-2] + value[i])
Decode Ways - A-Z Mapping
Target Sum - Assign + or - signs
Ninja Training / Job Scheduling
Min Path Sum - Grid DP
Unique Paths - dp[i][j] = dp[i-1][j] + dp[i][j-1]
Maximal Square - dp = min(neighbors) + 1
0/1 Knapsack - Take or Leave
Subset Sum - Check if sum possible
Partition Equal Subset Sum
Count Subsets for Target
Unbounded Knapsack - Unlimited items
Rod Cutting - Best value splits
Coin Change - Minimum coins needed
Coin Change - Total ways count
Longest Increasing Subsequence
Longest Decreasing Subsequence
Longest Bitonic Subsequence
Longest Common Subsequence
Edit Distance - Insert, Delete, Replace
Longest Palindromic Subsequence
Longest Palindromic Substring
Min Deletions to Make Palindrome
Min Insertions to Make Palindrome
Shortest Common Supersequence
Distinct Subsequences Count
Longest Common Substring
Wildcard Matching (?, *)
Regular Expression DP
Grid Paths with Obstacles
Cherry Pickup (2 robots)
Minimum Falling Path Sum
Dungeon Game - Min Health
Gold Mine Problem
Maximum Path Sum in Matrix
Traveling Salesman Problem
Count Ways to Assign Tasks
Match Job Applicants
Seating People With Constraints
Tree Diameter via DP
Count Nodes in Subtree
Max Sum Path in Tree
DP on Tree Coloring
Tree Matching - Max pairs
Count Numbers With K Digits Property
Count Without Repeating Digits
Digit Sum Problems
Frog Jump With K Distance
Burst Balloons - Max coins
Stone Game - Optimal play
Matrix Chain Multiplication
Palindrome Partitioning (Min Cuts)
Boolean Parenthesization
Painting Fence Problem
Peak and Valleys Finding
Rainwater Trapping Using DP
Gas Station Circular Route
Max Subarray After K Concatenations
Jump Game - Can reach end?
Minimum Jumps to End
Burst String (Remove Boxes)
Maximum Product Subarray
Game Theory with DP