Least Frequently Used (LFU) Cache
Company: Bytedance
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: hard
Interview Round: Onsite
Quick Answer: This question tests practical data structure design by requiring an O(1) implementation of a Least Frequently Used cache with tie-breaking by recency. It evaluates a software engineer's ability to combine hash maps and ordered collections to enforce eviction policies, a skill commonly assessed in system design and algorithm interviews.