mediumDSA

How does functools.lru_cache work?

Q: How does functools.lru_cache work?

**@lru_cache(maxsize=N)** memoizes a function's return values keyed by its arguments (which must be hashable), evicting least-recently-used entries when full. It dramatically speeds up repeated/recursive calls like memoized Fibonacci.

644 views

Understand the problem

Explain lru_cache.

lru-cache

Attempt it yourself

Sketch your approach before reading the solution — that's what interviews test.

Nudge consolestandby

Stuck? Beam a request up — the console returns a conceptual nudge that guides your logic without spoiling the implementation.

Study the solution

@lru_cache(maxsize=N) memoizes a function's return values keyed by its arguments (which must be hashable), evicting least-recently-used entries when full. It dramatically speeds up repeated/recursive calls like memoized Fibonacci.

Solution ready — 2 min read

Classified // press E to declassify

Run the code

PYCache hits/misses and LRU eviction with a small maxsize

Practice

Join the discussion

Discussion (0)

No responses yet. Be the first to share what you think.

Transmission complete // awaiting log

KEEP THE
STREAK ALIVE.

Dossier 56 of 120 decoded in the Python track. One more won't hurt.

Back to track

Next up→

How do you raise and split ExceptionGroups manually?

Continue