LFU cache, then distribute 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.
AmazonCodingNo answer yet. Write the first one; the best answer gets endorsed.