---
title: "Discussion on \"LeetCode 146: Lru Cache — Step-by-Step Visual Trace\" | Hashnode"
description: "Discussion on \"LeetCode 146: Lru Cache — Step-by-Step Visual Trace\". Design and implement a data structure for Least Recently Used (LRU) cache that supports get and put operations in O(1) time complexity."
url: "https://hashnode.com/posts/lru-cache-visualization/69d7d248cbde7a930d4aaed6"
---

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

Discussion

# [LeetCode 146: Lru Cache — Step-by-Step Visual Trace](https://blog.tracelit.dev/lru-cache-visualization?utm_source=hashnode&utm_medium=feed)

Design and implement a data structure for Least Recently Used (LRU) cache that supports get and put operations in O(1) time complexity.

Apr 9 · 2 min read · blog.tracelit.dev  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#linked-list](https://hashnode.com/tag/linked-list)

## Written by

[tracelit](https://hashnode.com/@tracelit)

@tracelit

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

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
