BeginnerCoder
Donate
Lesson 23 — Memoization by hand
Cache results
Memoization means storing computed answers in a dict (a cache) so repeated work is instant.
Why it matters: it turns slow recursive functions (like Fibonacci) into fast ones.
Store each result in the cache, then print fib(30) and how many entries the cache holds.
Run your code — when the output matches the task, you will see a green check. Then mark the lesson complete.
Test your knowledgeA quick 3-question quiz on this lesson — instant feedback.
Ready for more? Optional paid resources that pick up where this lesson leaves off.
Some links on this page are affiliate links: we may earn a commission at no extra cost to you. As an Amazon Associate I earn from qualifying purchases.
Project-based Python Foundations courses if you want a structured paid path after the free lessons. Wait for a sale — prices drop often.
Browse on Udemy →Search Amazon for Python Foundations books — check the publication year so the examples match current versions.
Search Amazon →