London | 25-SDC-July | Fatma Arslantas | Sprint 2 | Implement an LRU cache in Python

[AFatmaa]

Learners, PR Template

Self checklist

• I have titled my PR with Region | Cohort | FirstName LastName | Sprint | Assignment Title
• My changes meet the requirements of the task
• I have tested my changes
• My changes follow the style guide

Changelist

I implemented an LRU Cache in Python.

• I used OrderedDict from the Python collections library.
• OrderedDict works like a dictionary but remembers the order of items. This helps us achieve O(1) speed.
• How it works:
  • get(key): Returns the value and moves the item to the end (marks it as recently used).
  • set(key, value): Adds a new item. If the cache is full (limit reached), it removes the first item (the oldest one).
  • Added a check to raise an error if limit is 0 or less.

Questions

I don’t have any questions, thank you!

[cjyuan]

Looks good.

[AFatmaa]

Thank you @cjyuan 🙌