Dynamic programming
Building answers from the answers to smaller subproblems, remembered rather than recomputed.
| Status | Challenge | Topics | Level | Accepted | Save |
|---|---|---|---|---|---|
| 1.Climbing StairsCount the ways to climb n stairs taking one or two at a time. | Dynamic programmingMathRecursion | Easy | – | ||
| 2.Maximum SubarrayFind the largest sum of a run of consecutive numbers. | ArraysDynamic programmingGreedy | Medium | – | ||
| 3.Coin ChangeMake an amount with as few coins as possible. | Dynamic programming | Medium | – | ||
| 4.Longest Increasing SubsequenceFind the longest strictly rising sequence you can pick out of an array. | Dynamic programmingBinary search | Medium | – | ||
| 5.House RobberTake the most from a row of houses without taking two neighbours. | Dynamic programming | Medium | – | ||
| 6.Jump GameDecide whether you can jump from the first square to the last. | ArraysGreedyDynamic programming | Medium | – | ||
| 7.Unique PathsCount the paths across a grid moving only right or down. | Dynamic programmingMathMatrices | Medium | – | ||
| 8.Edit DistanceCount the fewest single-letter edits that turn one word into another. | StringsDynamic programming | Hard | – | ||
| 9.Longest Valid ParenthesesFind the longest balanced run in a string of parentheses. | StringsStacksDynamic programming | Hard | – | ||
| 10.Pattern MatchingMatch text against a pattern with . and * wildcards. | StringsDynamic programmingRecursion | Hard | – | ||
| 11.Best Path Sum in a TreeFind the path through a binary tree whose values add up to the most. | TreesRecursionDynamic programming | Hard | – |