Design LRU Cache Data Sturcture | LeetCode 146. LRU Cache | Least Recently Used Cache (LRU Cache)
📝Statement: Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.Implement the LRUCache class: # LRUCache(int capacity) Initialize the LRU cache with positive size capacity.
int get(int key) Return the value of the key if the key exists, otherwise return -1.
void put(int key, int value) Update the value of the key if the key exists. Otherwise, add the key-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recently used key.
Follow up:Could you do get and put in O(1) time complexity?
🛣️Source code: https://github.com/techbarik/LeetCode...
👨💻Link to the problem: https://leetcode.com/problems/lru-cache/
🎬LeetCode PlayList: • LeetCode Solution
✅️BEST RESOURCES FOR SOFTWARE ENGINEERING PREP
🗺️Cracking The Coding Interview: https://amzn.to/3i5bPkE
🗺️Daily Coding Problem: https://amzn.to/3n3NaAL
✔️EQUIPMENT I USED IN THIS VIDEO:
🎤Microphone: https://amzn.to/2G2xtsI
✴️PRACTICE CODING QUESTIONS
👨💻LeetCode: https://leetcode.com/
👨💻HackRank: https://www.hackerrank.com/
❇️FREE RESOURCE ONLINE
🟠https://www.geeksforgeeks.org/practic...
⚡ Please leave a LIKE and SUBSCRIBE for more content! ⚡
⭐ Tags ⭐
LeetCode- LeetCode 146. LRU Cache
CS Ninja
Software Engineering
LRU Cache- Least Recently Used Cache (LRU Cache)- Data Structure Design- Design a Data Structure LRU Cache
⭐ Hashtags ⭐
#leetcode
Disclosure: Some links are affiliate links to products. I may receive a small commission for purchases made through these links. #csninja
Watch video Design LRU Cache Data Sturcture | LeetCode 146. LRU Cache | Least Recently Used Cache (LRU Cache) online without registration, duration hours minute second in high quality. This video was added by user BarikZone 01 January 1970, don't forget to share it with your friends and acquaintances, it has been viewed on our site 124 once and liked it 3 people.