Implement a size-bounded LRU cache

Q: How do I practice coding and algorithm questions?

Use PracHub's coding console to write, test, and debug your solutions in Python or JavaScript. View hints, test against sample inputs, and compare with official solutions.

Q: What difficulty level is this coding question?

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

Q: What role is this question designed for?

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

Question

Implement a size-bounded LRU cache

PracHub · Accepted Answer

This question evaluates a candidate's ability to design and implement efficient data structures for capacity-bound caching, focusing on handling variable-sized items, eviction policies, and maintaining O(1) average get/put invariants.

Quick Overview

Implement a size-bounded LRU cache