Netflixseniormar. de 2026
Onsite
Implement an LRUCache that supports O(1) average-time get(key) returning the value or -1 and put(key, value) which inserts or updates a key and, if capacity is exceeded, evicts the least-recently-used key. The core challenge is maintaining key-value storage together with recency ordering to enable constant-time access, updates, and eviction.
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
Onsite
Same question of LRU Cache
In tech phone screen I was asked to design LRU Cache
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.