Cache Trade-offs and a Constant-Time Least-Recently-Used Cache

Quick Overview

A two-part caching exercise: discuss the trade-offs of placing a cache in front of a slower data source, then implement a fixed-capacity least-recently-used cache with constant-time get and put. It tests reasoning about eviction and freshness, data-structure invariants, and careful handling of updates and eviction order.

Cache Trade-offs and a Constant-Time Least-Recently-Used Cache

Company: Goldman Sachs

Role: Software Engineer

Category: Software Engineering Fundamentals

Difficulty: easy

Interview Round: Onsite

Overview: A two-part caching exercise: discuss the trade-offs of placing a cache in front of a slower data source, then implement a fixed-capacity least-recently-used cache with constant-time get and put. It tests reasoning about eviction and freshness, data-structure invariants, and careful handling of updates and eviction order.

Goldman Sachs logo
Goldman Sachs
Sep 13, 2026
easySoftware EngineerOnsiteSoftware Engineering Fundamentals
2
0
Loading...