Problem
Write a recursive algorithm to solve a classic dynamic programming problem, such as the Fibonacci sequence or the climbing stairs problem, and then optimize it using memoization.
You are practicing as a guest. Sign up free to get your answer graded with AI feedback. Your draft stays right here.
