← Questions
LFU cache, then distribute it
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Design and implement a least-frequently-used cache with get and put in O(1), evicting the least used key and, among ties, the least recently used. The input then becomes a stream too large for one machine: extend the design to a distributed cache and explain how keys are split and how frequencies are kept.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding