Interview Questions Interview Guides Experiences Mock Interviews Pricing

Interview Guides

Implement LRU Cache Operations | Dataford Interview Questions

All questions/Coding

Implement LRU Cache Operations

MediumHash TablesLinked Listscache

Problem

Design an LU cache that supports get(key) and put(key, value) in average O(1) time. The cache has a fixed positive integer capacity. get(key) returns the value for key if it exists, otherwise -1. put(key, value) inserts or updates the key; if the cache exceeds capacity, evict the least recently used key.

Implement a class LRUCache with methods get(key) and put(key, value).

Problem

Design an LU cache that supports get(key) and put(key, value) in average O(1) time. The cache has a fixed positive integer capacity. get(key) returns the value for key if it exists, otherwise -1. put(key, value) inserts or updates the key; if the cache exceeds capacity, evict the least recently used key.

Implement a class LRUCache with methods get(key) and put(key, value).

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Accenture

Implement LRU Cache OperationsMedium

quadric

Implement an LRU CacheMedium

Capgemini FSSBU

Design an LRU CacheMedium