Manchester | 25-SDC-Nov | Rahwa Haile | Sprint 2 | Implement an LRU cache in Python

[RahwaZeslusHaile]

Manchester | 25-SDC-Nov | Rahwa Haile | Sprint 2 | Implement an LRU cache in Python

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

Title
Implement LRU Cache with O(1) Time Complexity

Description
Implements an LRU (Least Recently Used) cache that supports O(1) time complexity for all operations using a doubly-linked list and a hash map.

Features:

LruCache(limit) - Initialize cache with max capacity
get(key) - Retrieve value and mark as recently used
set(key, value)- Store/update value, evict LRU item when full

Please review my work — thank you!

[cjyuan]

To better adhere to the Single-Responsibility Principle (SRP) from SOLID design principles,
it's preferable to implement the "doubly linked list" and the "LRU Cache" as separate classes, with the linked list used inside LruCache to manage ordering.

Alternatively, OrderedDict can be used directly within LruCache to maintain order.

Could you update your code using one of these approaches?

[RahwaZeslusHaile]

@cjyuan Thanks for the suggestion! I've refactored the code to separate concerns:

DoublyLinkedList: handles list operations
LruCache: focuses on cache logic

[cjyuan]

LGTM. Well done.