How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a medium difficulty Coding & Algorithms question, commonly asked during Onsite rounds at Google.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Google during technical interviews.

Implement an LRU cache | Google Interview Question

Q: Implement an LRU cache

This question evaluates competency in data structure design and algorithmic complexity by requiring a bounded key-value cache with O(1) average-time get and put operations.

Design a key-value cache with a fixed capacity. It must support:

get(key) : return the value for the key if it exists, otherwise return -1 .
put(key, value) : insert or update the key. If the cache is full, evict the least recently used key before inserting the new one.

Both operations should run in O(1) average time.

Implement an LRU cache

Quick Overview

Comments (0)