Practice LinkedIn Coding Question | Real Coding Interviews

Quick Summary

Design a fixed-capacity cache that stores key-value pairs alongside integer priority ranks.
Return cached values on hits, fetch from a slow data source on misses, and evict the lowest-ranked entry when at capacity.
Handle rank ties by allowing the removal of any minimum-rank item.

What This Tests

Common Patterns

Hashing

Hint 1

Hint 2

Hint 3

What Interviewers May Ask Next

Report seen similar question in interview

python

Stdout