Implement a TTL LRU Cache

Read the full interview experience this question came from →

Quick Overview

This question evaluates understanding of in-memory cache design, including per-entry TTL expiration, LRU eviction, and the data structure and complexity trade-offs required to achieve O(1) average operations.

Implement a TTL LRU Cache

Company: Nimble

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Technical Screen

Overview: This question evaluates understanding of in-memory cache design, including per-entry TTL expiration, LRU eviction, and the data structure and complexity trade-offs required to achieve O(1) average operations.

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

|Home/Coding & Algorithms/Nimble
Nimble logo
Nimble
May 21, 2026
hardSoftware EngineerTechnical ScreenCoding & Algorithms
1
0
Loading...

Submit Your Answer to Earn 20XP

Sign in to leave a comment

Loading comments...