challenge

Timed Full-Stack Challenges

52 / 53

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

Timed Full-Stack Challenges

Practice implementing classic data structures under time pressure. An LRU cache keeps recently used items and evicts the oldest when capacity is exceeded.

Your Task

Implement an LRUCache class with get and put.

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

Timed Full-Stack Challenges

Practice implementing classic data structures under time pressure. An LRU cache keeps recently used items and evicts the oldest when capacity is exceeded.

Your Task

Implement an LRUCache class with get and put.

1 min read

Timed Full-Stack Challenges

Practice implementing classic data structures under time pressure. An LRU cache keeps recently used items and evicts the oldest when capacity is exceeded.

Your Task

Implement an LRUCache class with get and put.

1 min read

Timed Full-Stack Challenges

Practice implementing classic data structures under time pressure. An LRU cache keeps recently used items and evicts the oldest when capacity is exceeded.

Your Task

Implement an LRUCache class with get and put.