Skip to content

OCT-2025-2 | Roman Pavlenko | Module-Complexity | Sprint 2 | Implement an LRU cache in Python - #2

Open
DraftRoman wants to merge 3 commits into
mainfrom
LruCache
Open

OCT-2025-2 | Roman Pavlenko | Module-Complexity | Sprint 2 | Implement an LRU cache in Python#2
DraftRoman wants to merge 3 commits into
mainfrom
LruCache

Conversation

@DraftRoman

Copy link
Copy Markdown
Owner
  • Implemented LinkedList with proper push_head, pop_tail, and remove operations
  • Added Node structure with bidirectional links
  • Introduced LruCache with get, put, and set methods
  • Cache enforces capacity limit using LRU eviction strategy
  • Updated tests for linked list removal edge cases (head and tail)
  • Added validation for invalid cache size (limit <= 0)

…s: pointer to previous node) LinkedList class state(head = first element | tail = last element) push_head(value) - Insert a new node at the start of the list
@DraftRoman DraftRoman changed the title OCT-2025-2 | Roman Pavlenko | Module-Complexity | Sprint 2 | Implement a linked list in Python OCT-2025-2 | Roman Pavlenko | Module-Complexity | Sprint 2 | Implement an LRU cache in Python Jun 11, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant