Implement LRU Cache (Python)
Implement LRU Cache in Python. Watch someone try to design and implement a data structure for Least Recently Used (LRU) cache in this mock interview.
Watch the full-length mock interview here for free: https://interviewing.io/mocks/microso...
It should support the following operations: get and put.
Get(key) - Get the value (will always we positive) of the key if the key exists in the cache, otherwise return -1.
Put(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item
The cache is initialized with a positive capacity.
To watch more data structures mock interviews and solutions: https://interviewing.io/questions/
Overview of Problem (00:00)
Implementation (02:20)
Creating the Class (13:30)
Feedback (33:25)
On this page of the site you can watch the video online Implement LRU Cache (Python) with a duration of hours minute second in good quality, which was uploaded by the user interviewing.io 26 September 2022, share the link with friends and acquaintances, this video has already been watched 1,076 times on youtube and it was liked by 8 viewers. Enjoy your viewing!
