Interview Questions Interview Guides Experiences Mock Interviews Pricing

Interview Guides

Implement LRU Cache Operations | Dataford Interview Questions

All questions/Coding

Asked 1mo ago|

Accenture

Implement LRU Cache Operations

MediumHash TablesLinked Listscaching

Problem

Design an LRU (Least Recently Used) cache with a fixed positive capacity. Implement a class that supports get(key) and put(key, value) in O(1) average time. get returns the value for key if present, otherwise -1. put inserts or updates the key; if the cache exceeds capacity, evict the least recently used key.

Problem

Design an LRU (Least Recently Used) cache with a fixed positive capacity. Implement a class that supports get(key) and put(key, value) in O(1) average time. get returns the value for key if present, otherwise -1. put inserts or updates the key; if the cache exceeds capacity, evict the least recently used key.

Practice Python

Python 3.10

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

Up next

NTT DATA

Implement LRU Cache OperationsMedium

quadric

Implement an LRU CacheMedium

Capgemini FSSBU

Design an LRU CacheMedium