InterviewBit Problems   LRU Cache : Solved


JAVA - O(1) solution (1)
C++ Solution with only one map (1)
O(1) solution in python 🐍 (2)
Wrong Test Case for Insertion when cache is never used (1)
7 2 G 2 S 2 6 G 1 S 1 5 S 1 2 G 1 G 2 - Wrong expected value (2)
Done Without maps , only linked list; Submits successfully, Is it okay? (1)
Simple solution using LinkedHashMap [Java, LOC: 23] (1)
Easy C++ soln in O(1) using unordered_map and list (1)
C++, get and set in O(log n), using list and map (1)
C++ solution using only map (1)
C++ Solution using Map and Doubly Linked List (1)
C++ Solution using std::list (1)
Title of your comment do it (1)
Did it without using Lined Lists (1)
Time- based solution (1)
Easy approach using concept of time (1)
Get(key): if the key exists at iterator "it", can be viewed as set(key,it->second) (1)
C++ API for this problem is very bad (1)
Why can't I use list STL for this problem? (1)