← 🐍 Python Foundations
23 / 27
Lesson 23 — Memoization by hand
Cache results
Store computed answers in a dict so repeated work is instant.
Why it matters: it turns slow recursive functions (like Fibonacci) into fast ones.
Not clear enough?
Task
Finish memoized fib and print fib(30).
🧠 Test your knowledge
A quick 3-question quiz on this lesson — instant feedback.
Keep going with Python Foundations
Ready for more? These paid resources pick up where this lesson leaves off.
UdemyBestsellers
Top-rated Python Foundations courses
Project-based Python Foundations video courses — the perfect paid next step after these free lessons.
Browse on Udemy →AmazonReader picks
Best Python Foundations books
Hand-picked Python Foundations books to master the fundamentals offline.
See on Amazon →Some links on this page are affiliate links: we may earn a commission at no extra cost to you. We only recommend tools we believe are genuinely useful.