Home
Learn
Feed
Ladder
Saved

📐

Dynamic Programming

Master DP patterns end to end: grids, knapsack, sequences, and state machines.

Curriculum · 32 lessons

01Generating Subsetsintro3m 02The Subset Sum Patterncore4m 03Coin Changecore4m 04Palindrome Detection with Expansioncore5m 05The Unbounded Knapsackcore4m 06Longest Common Subsequencecore5m 07The Subsets Patterncore5m 08The Zero One Knapsackcore5m 09The Knapsack Problemcore5m 10Greedy versus Dynamic Programmingcore5m 11Memoization versus Tabulationcore5m 12Palindrome Partitioningcore4m 13The Partition By Pivotcore5m 14The Longest Common Subsequence Recurrencecore6m 15Edit Distance Variantscore6m 16The Edit Distance Recurrencecore6m 17Dynamic Programming Introcore5m 18Edit Distancecore5m 19Bitmask Dynamic Programmingcore5m 20Longest Increasing Subsequencecore5m 21Interval Dynamic Programmingcore5m 22Longest Common Substring With Suffixcore5m 23Manacher Palindromes Deepcore6m 24Interval DPcore5m 25Digit Dynamic Programmingcore6m 26The Longest Common Prefix Arrayadvanced6m 27Quicksort Partition Schemesadvanced5m 28The Longest Repeated Substringadvanced5m 29Dynamic Programming State Designadvanced6m 30Bitmask DPadvanced6m 31Digit DPadvanced6m 32Memoized Backtrackingadvanced5m

Practice · 248 problems

⚔️Fibonacci Number1000 ⚔️Climbing Stairs1050 ⚔️Count Vowel Permutations1050 ⚔️Minimum Moves to Equal Array Elements1050 ⚔️Unique Paths1050 ⚔️Tribonacci Number1050 ⚔️Equal Sum Split Points1050 ⚔️N-th Tribonacci Number1050 ⚔️Count Ways To Reach Score1080 ⚔️Perfect Squares1100 ⚔️Minimum Cost Path in Grid1100 ⚔️Maximum Points Moving Right or Down1100 ⚔️Domino Tiling Count1100 ⚔️Maximum Sum of Non-Adjacent Elements1100 ⚔️Minimum Cost Climbing Stairs1100 ⚔️Paint House Minimum Cost1100 ⚔️House Robber1150 ⚔️Minimum Path Sum1150 ⚔️Triangle Minimum Total1150 ⚔️Integer Break1150 ⚔️Count Palindromic Substrings1150 ⚔️Number of Dice Rolls With Target Sum1150 ⚔️Unique Paths II1150 ⚔️Paint Fence1150

+ 224 more in the arena