All challenges

Recursion

Functions that call themselves on smaller pieces of the problem.

StatusChallengeLevelSave
1.Climbing StairsCount the ways to climb n stairs taking one or two at a time.Easy
2.Depth of a TreeCount the levels of a binary tree, from the root to its deepest leaf.Easy
3.Invert a TreeMirror a binary tree, swapping every node's left and right children.Easy
4.Generate ParenthesesList every balanced string of n pairs of parentheses.Medium
5.Valid Search TreeCheck whether a binary tree keeps the search tree order everywhere.Medium
6.N QueensCount the ways to place n queens on an n × n board with none attacking another.Hard
7.Pattern MatchingMatch text against a pattern with . and * wildcards.Hard
8.Best Path Sum in a TreeFind the path through a binary tree whose values add up to the most.Hard