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)
En esta página del sitio puede ver el video en línea Implement LRU Cache (Python) de Duración hora minuto segunda en buena calidad , que subió el usuario interviewing.io 26 septiembre 2022, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 1,076 veces y le gustó 8 a los espectadores. Disfruta viendo!
