Quick Overview

Simulate an LRU cache through a portable sequence of get and put operations. The question defines recency updates, least-recent eviction, existing-key replacement, missing-key results, ordered output, positive capacity, and average constant-time operations.

Simulate a Least Recently Used Cache

Company: Oracle

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: easy

Interview Round: Onsite

Overview: Simulate an LRU cache through a portable sequence of get and put operations. The question defines recency updates, least-recent eviction, existing-key replacement, missing-key results, ordered output, positive capacity, and average constant-time operations.

Read the full Oracle Software Engineer interview experience this question came from

Loading…