challenge

Challenge: LRU Cache

11 / 47

60 minchallenge

You completed the free preview — you are ready for the full path.

All lessons are readable below. To write and run code from lesson 11 onwards, upgrade to Path Plus ($9/mo) or Pro.

1 min read

Implement a Least Recently Used cache with O(1) get and put operations. Use a combination of HashMap and doubly-linked list.

What You'll Learn

class LRUCache {
  constructor(capacity) {
    this.capacity = capacity;
    this.cache = new Map();
  }
  
// ...

You completed the free preview — you are ready for the full path.

All lessons are readable below. To write and run code from lesson 11 onwards, upgrade to Path Plus ($9/mo) or Pro.

1 min read

Implement a Least Recently Used cache with O(1) get and put operations. Use a combination of HashMap and doubly-linked list.

class LRUCache {
  constructor(capacity) {
    this.capacity = capacity;
    this.cache = new Map();
  }
  
// ...

1 min read

Implement a Least Recently Used cache with O(1) get and put operations. Use a combination of HashMap and doubly-linked list.

class LRUCache {
  constructor(capacity) {
    this.capacity = capacity;
    this.cache = new Map();
  }
  
// ...

1 min read

Implement a Least Recently Used cache with O(1) get and put operations. Use a combination of HashMap and doubly-linked list.

class LRUCache {
  constructor(capacity) {
    this.capacity = capacity;
    this.cache = new Map();
  }
  
// ...