DSA learning path
Recursion & Backtracking
Recursive state, decision trees, pruning and exhaustive search.
Problems in this path
- Generate All SubsetsOpen
Easy · Include or Exclude - Generate Valid ParenthesesOpen
Medium · Constrained Backtracking - Count N-Queens SolutionsOpen
Hard · Backtracking with Sets - Generate All PermutationsOpen
Medium · Backtracking Choices - Choose K CombinationsOpen
Medium · Combination Backtracking - Combination Sum with ReuseOpen
Medium · Pruned Backtracking - Phone Keypad CombinationsOpen
Medium · Cartesian Backtracking - Palindrome PartitionsOpen
Hard · Partition Backtracking - Count Paths Through a Blocked MazeOpen
Medium · Grid Backtracking - Kth Grammar SymbolOpen
Hard · Recursive Symmetry