Skip to content

Topic 10 of 21

Recursion & Backtracking Problems

Subsequences, subsets, combination sums, palindrome partitioning, N-Queens, Rat in a Maze, M-Coloring and Sudoku Solver.

24 recursion & backtracking problems (2 easy, 14 medium, 8 hard) with LeetCode and GeeksforGeeks links.

Your progress

– / 24 solved

Easy
–/2
Medium
–/14
Hard
–/8
  1. Recursive Implementation of atoi()HardLeetCodeGFG
  2. Pow(x, n)MediumLeetCodeGFG
  3. Count Good NumbersEasyLeetCodeGFG
  4. Sort a Stack Using RecursionMediumGFG
  5. Reverse a Stack Using RecursionEasyGFG
  6. Generate All Binary StringsMediumGFG
  7. Generate ParenthesisMediumLeetCodeGFG
  8. Print All Subsequences/Power SetMediumLeetCodeGFG
  9. Count All Subsequences with Sum KHardLeetCode
  10. Check If There Exists a Subsequence with Sum KMediumGFG
  11. Combination SumMediumLeetCodeGFG
  12. Combination Sum-IIMediumLeetCodeGFG
  13. Subset Sum-IMediumGFG
  14. Subset Sum-IIMediumLeetCodeGFG
  15. Combination Sum - IIIHardLeetCode
  16. Letter Combinations of a Phone NumberMediumLeetCode
  17. Palindrome PartitioningMediumLeetCodeGFG
  18. N QueenHardLeetCodeGFG
  19. Rat in a MazeHardGFG
  20. Word BreakMediumLeetCodeGFG
  21. M Coloring ProblemHardGFG
  22. Sudoku SolverHardLeetCodeGFG
  23. Expression Add OperatorsHardLeetCodeGFG