Implement memoized Fibonacci using a dictionary cache

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Problem

Implement memoized Fibonacci using a dictionary cache. Define fib(n) that checks the cache before computing. Print fib(10) and fib(20).

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.