The Eviction Policy

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L4

Problem

Implement LRUCache(capacity) with get(key) (returns value or -1) and put(key, value). Evict least recently used when capacity is exceeded. Both operations O(1). Test harness passes ['LRUCache', capacity] then op sequences; expects list of return values (None for constructor/put, value or -1 for get).

Summary

Fixed capacity. Oldest unused entry gets evicted.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.