---
title: "Discussion on \"Design an LRU cache\" | Hashnode"
description: "Discussion on \"Design an LRU cache\". LRU (Least Recently Used) is a cache replacement algorithm that removes the least recently used data in order to make room for new data.\nImplement LRU cache"
url: "https://hashnode.com/posts/design-an-lru-cache/62337d7abef4c71aa6f0ced8"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Design an LRU cache](https://rajatexplains.dev/design-an-lru-cache?utm_source=hashnode&utm_medium=feed)

LRU (Least Recently Used) is a cache replacement algorithm that removes the least recently used data in order to make room for new data. Implement LRU cache

Mar 17, 2022 · 4 min read · rajatexplains.dev  
Read the article

-   [#distributed-system](https://hashnode.com/tag/distributed-system)
-   [#javascript](https://hashnode.com/tag/javascript)
-   [#cache](https://hashnode.com/tag/cache)
-   [#interview](https://hashnode.com/tag/interview)
-   [#frontend](https://hashnode.com/tag/frontend)

## Written by

[Rajat Jain](https://hashnode.com/@rajatexplains)

@rajatexplains · Bengaluru, India

  
[View profile](https://hashnode.com/@rajatexplains)

Software Engineer II 👨‍💻 at Uber | ex-Microsoft | Javascript ❤️ | Mentor 👨‍🏫 at CodeAsylums | Tech Speaker 🗣️ | React | GraphQL

I am a UI/UX enthusiast currently working as an engineer in Uber. Prior to this, I was at Microsoft for 4 years working on their most loved and complex product Microsoft Teams. I have a professional experience of training students in software engineering and computer science concepts and helping them land their dream jobs.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
