Recursion Topics

Master essential recursion problems and patterns frequently asked in interviews.

•   01 Factorial Classic recursion example, base and recursive cases
•   02 Fibonacci Sequence Recursive sequence generation with memoization
•   03 Power Set / Subsets Backtracking pattern for generating all subsets
•   04 String Permutations Backtracking pattern for all permutations of a string
•   05 N-Queens Problem Backtracking with constraints to place queens safely

WONDERING, HOW DOES IT COVER PATTERNS?
These problems cover the most important recursion and backtracking patterns for interviews:

Factorial → Basic recursion with base case and simple recursive call.
Fibonacci Sequence → Simple recursion, optimized with memoization / DP.
Power Set / Subsets → Backtracking, decision tree recursion pattern.
String Permutations → Recursive swapping / backtracking to generate all permutations.
N-Queens Problem → Constraint-based backtracking recursion pattern.

Together, they ensure you understand base recursion, recursive sequence generation, subset generation, permutation generation, and backtracking with constraints in recursion problems.