# Optimal O(1), O(n) - double linked list for O(1) deletions/additions to update recency ...
🔥 Day 19/250 - NeetCode Daily Challenge 🔥 🚀 Problem: 146. LRU Cache 🧩 Difficulty: Medium Approach: Time Complexity: O (1) Space Complexity: O (N) 🚀 On to the next one! #LeetCode #CodingChallenge ...
zero to one: foundational engineering paradigm > concepts - algorithms : design, hash maps, linked list > notes > problem: Design LRU cache -> This problem was simply amazing. It opened up ideas that ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results