YOU’RE LEARNING TO↗learner can implement factorial and Fibonacci with and without memoization
↗learner can articulate the difference between top-down (memoization) and bottom-up (tabulation) DP
↗learner can write a recursive sum-of-digits function
↗learner can generate all permutations of a list recursively
↗learner can solve coin-change (minimum coins) with bottom-up DP
↗learner can count climbing-stairs paths with DP
↗learner can compute longest common subsequence with DP
The learning room