All challenges

Dynamic programming

Building answers from the answers to smaller subproblems, remembered rather than recomputed.

StatusChallengeLevelSave
1.Climbing StairsCount the ways to climb n stairs taking one or two at a time.Easy
2.Maximum SubarrayFind the largest sum of a run of consecutive numbers.Medium
3.Coin ChangeMake an amount with as few coins as possible.Medium
4.Longest Increasing SubsequenceFind the longest strictly rising sequence you can pick out of an array.Medium
5.House RobberTake the most from a row of houses without taking two neighbours.Medium
6.Jump GameDecide whether you can jump from the first square to the last.Medium
7.Unique PathsCount the paths across a grid moving only right or down.Medium
8.Edit DistanceCount the fewest single-letter edits that turn one word into another.Hard
9.Longest Valid ParenthesesFind the longest balanced run in a string of parentheses.Hard
10.Pattern MatchingMatch text against a pattern with . and * wildcards.Hard
11.Best Path Sum in a TreeFind the path through a binary tree whose values add up to the most.Hard