Sheffield | 25-SDC-Nov | Hassan Osman | Sprint 2 | Implement an LRU cache in Python#126

Open

HassanOHOsman wants to merge 12 commits intoCodeYourFuture:mainfrom

HassanOHOsman:feature/implement-LRU-cache

Commits on Feb 27, 2026

start constructing LRU cache with inital data points (key & limit/capacity)
HassanOHOsman
committed
fixed the constructor/ internal state
HassanOHOsman
committed
build a function that sets key and value
HassanOHOsman
committed
update the internal structure of the set method so that it pairs a key and it's associated value corretly inside the cache structure
HassanOHOsman
committed
construct a method that returns a value associated with a key
HassanOHOsman
committed
get rid of the unnecessary problematic line from set method to avoid bugs
HassanOHOsman
committed
replace normal dict {} with OrderedDict so that we're able to maintain keys order and thus be able to eventually remove the least recently used one.
HassanOHOsman
committed
update set method to check if a key is present in cache. If true - mark as most recently used by moving it to be the tail
HassanOHOsman
committed
update set method to handle when the number of keys inside a cache is greater than its limit and if so the least recently used key is removed
HassanOHOsman
committed
update get method to mark a key as the most recently used if it's present in cache - else do nothing
HassanOHOsman
committed
inside set method, in the else condition, update the argument for .popitem() method so the oldest item (least cently used) gets removed for cache
HassanOHOsman
committed
update the initializer inside the LruCache class to throw an error when the cash limit is zero and below - This leads to passing the last remaining unit test
HassanOHOsman
committed

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sheffield | 25-SDC-Nov | Hassan Osman | Sprint 2 | Implement an LRU cache in Python#126

Sheffield | 25-SDC-Nov | Hassan Osman | Sprint 2 | Implement an LRU cache in Python#126
HassanOHOsman wants to merge 12 commits intoCodeYourFuture:mainfrom
HassanOHOsman:feature/implement-LRU-cache

Commits on Feb 27, 2026

start constructing LRU cache with inital data points (key & limit/capacity)

fixed the constructor/ internal state

build a function that sets key and value

update the internal structure of the set method so that it pairs a key and it's associated value corretly inside the cache structure

construct a method that returns a value associated with a key

get rid of the unnecessary problematic line from set method to avoid bugs

replace normal dict {} with OrderedDict so that we're able to maintain keys order and thus be able to eventually remove the least recently used one.

update set method to check if a key is present in cache. If true - mark as most recently used by moving it to be the tail

update set method to handle when the number of keys inside a cache is greater than its limit and if so the least recently used key is removed

update get method to mark a key as the most recently used if it's present in cache - else do nothing

inside set method, in the else condition, update the argument for .popitem() method so the oldest item (least cently used) gets removed for cache

update the initializer inside the LruCache class to throw an error when the cash limit is zero and below - This leads to passing the last remaining unit test