⌛ Recursion

Recursive algorithms involve a function calling itself in order to solve a smaller version of a problem. In surface, recursion could look trivial and simple.

While the entire skill set of identifying sub-problems, settling the base case, crafting the merging process is uniquely challenging.

Learning Material (acquire basic understanding of recursion)

• Towers of Hanoi: A Complete Recursive Visualization

• 5 Simple Steps for Solving Any Recursive Problem

Learning Material (understand the essence of recursion: divide and conquer)

• 1.8.4 Strong Induction: Video (give a taste on how mathematical induction works)

• CLRS 2.3.1 The divide-and-conquer approach

• Divide & Conquer: Convex Hull, Median Finding (application)

• Practices

  • E 206. Reverse Linked List (solve using recursion)

  • E 70. Climbing Stairs

• Graduation Challenge

  • M 169 · Tower of Hanoi (classic for understanding recurrence relation)

  • M 95. Unique Binary Search Trees II

  • M 1922. Count Good Numbers