Complete Guide to Recursion Patterns

Master all recursion patterns with visualizations, templates, and LeetCode examples

12 Patterns
36+ LeetCode Problems
100% Interview Ready
Recursion Tree Visualization

Quick Reference Guide

Time Complexities

  • Linear Recursion: O(n)
  • Tree Recursion: O(2^n)
  • Divide & Conquer: O(n log n)
  • With Memoization: O(n)

Common Patterns

  • Base Case: Stopping condition
  • Recursive Case: Self-calling logic
  • Backtracking: Undo choices
  • Memoization: Cache results

Problem Types

  • Generation: Create all possibilities
  • Decision: Find valid solutions
  • Optimization: Find best solution
  • Counting: Count possibilities