LFU Cache is the harder version of LRU. Instead of evicting the least recently used item, you evict the least frequently used one. Ties go to the least recently used among those.
This forces you to coordinate hash maps and track a minimum frequency counter. It tests your ability to maintain multiple invariants simultaneously while keeping every operation at . Amazon asks this in harder rounds to separate candidates who can design complex data structures from those who only handle the basics.