Data Structures & Algorithms in Python

Recursion, Backtracking & Dynamic Programming

30 min10 activities0 complete

1 of 10

Explore the idea

Recursion: Mental Model & Anatomy

Opening your lesson…

Opening your space…

IN THIS LESSON

YOU’RE LEARNING TO

↗write recursive solutions with correct base cases

↗apply memoization using functools.lru_cache to eliminate redundant computation

↗convert a top-down memoized solution to bottom-up tabulation

↗solve classic DP problems: Fibonacci, coin change, and longest common subsequence

↗implement backtracking to generate all permutations and subsets

↗identify when recursion is inappropriate (deep stacks) and use iteration instead