Dynamic Programming • Beginner • 15 min
Climbing Stairs
How to notice the recurrence from the last two choices and use that as an entry point to dynamic programming.
Challenges · Dynamic Programming
Practice problems with walkthroughs, hints, and solutions.
Filter by type or level
AllAdvancedArrays and Dynamic ProgrammingArrays and Hash MapArrays and Prefix/SuffixArrays and SetArrays and Single PassArrays and Two PointersBacktrackingBeginnerData Structure DesignDynamic ProgrammingGraphsGraphs on a GridHash MapHeapHeap and FrequencyIntermediateIntervalsLinked ListMatrixSearchSliding WindowStackStrings and ExpansionStrings and Frequency CountStrings and Two PointersTreesTrie
Dynamic Programming • Intermediate • 25 min
Coin Change
How to move away from blind combinations and build a DP that searches for the minimum cost for each value up to the target.
Dynamic Programming • Intermediate • 18 min
House Robber
How to model the choice between robbing or skipping each house while respecting the adjacency constraint.
Dynamic Programming • Intermediate • 22 min
Word Break
How to turn string segmentation into prefix [dynamic programming](/glossary/dynamic-programming) instead of retrying the same cut over and over.
Dynamic Programming • Intermediate • 25 min
Longest Common Subsequence
How to turn comparison between two strings into a table of subproblems instead of repeating [recursion](/glossary/recursion) choices.
Dynamic Programming • Intermediate • 22 min
Longest Increasing Subsequence
How to start from [O(n²)](/glossary/o-n-squared) [dynamic programming](/glossary/dynamic-programming) and reach the idea of smallest possible endings with [binary search](/glossary/binary-search).