Skip to content

Latest commit

 

History

History
53 lines (49 loc) · 3.18 KB

File metadata and controls

53 lines (49 loc) · 3.18 KB

Recursion

Problems exploring recursive thinking, backtracking, and divide-and-conquer approaches.

Key Concepts Covered

  • Base case and recursive case design
  • Call stack understanding
  • Tail recursion optimization
  • Backtracking algorithms
  • Divide and conquer
  • Memoization (leading to DP)
  • Tree recursion vs linear recursion

Problems in this Directory

Tips

  • Always define a clear base case
  • Make sure recursion progresses toward base case
  • Watch out for stack overflow with deep recursion
  • Consider iterative alternatives for tail-recursive functions
  • Pass by const reference for large data structures