Tagged articles

O(1)

3 articles · Page 1 of 1

Oct 8, 2025 · Fundamentals

Mastering LRU Cache: O(1) Implementation with Hash‑Linked List in Java

This article explains the LRU cache eviction strategy, details its O(1) get and put operations using a combined hash table and doubly linked list, and provides a complete Java implementation with step‑by‑step code examples and design rationale.

Doubly Linked ListHash TableJava

0 likes · 10 min read

Mastering LRU Cache: O(1) Implementation with Hash‑Linked List in Java

Nullbody Notes

Nov 17, 2023 · Fundamentals

How to Implement an O(1) LRU Cache for Interview Success

This article explains how to implement an O(1) LRU cache in Go by combining a hash table with a doubly linked list, detailing the put and get operations, eviction policy, and providing complete, ready‑to‑run source code along with illustrative diagrams.

Cache EvictionDoubly Linked ListGo

0 likes · 4 min read

How to Implement an O(1) LRU Cache for Interview Success

Architect's Guide

Sep 10, 2022 · Fundamentals

Java Implementation of an O(1) LRU Cache Using a Doubly Linked List and HashMap

This article explains the design and Java implementation of an LRU (Least Recently Used) cache that achieves O(1) time complexity for get and put operations by combining a doubly linked list with a hash map, and provides full source code and usage examples.

JavaLRU CacheO(1)

0 likes · 10 min read

Java Implementation of an O(1) LRU Cache Using a Doubly Linked List and HashMap