BeginnerCoder
Donate
Lesson 25 — Ultimate: LRU cache class
Boss level: build a cache
Implement least-recently-used eviction with an OrderedDict — a real systems-design task. move_to_end marks a key as recent; popitem(last=False) removes the oldest.
Why it matters: LRU caches sit inside browsers, databases and CPUs.
Finish put(): when the cache is over capacity, evict the least recently used key. Expected output: -1 1 3
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 Intermediate 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 Intermediate books — check the publication year so the examples match current versions.
Search Amazon →