Designing Data Structures Questions

Focuses on designing and implementing common data structures and simple caches such as a least recently used cache, a least frequently used cache, or a linked hash map. Candidates should explain the public interface they would expose, the time and space complexity of each operation, memory overhead, and trade offs between different eviction and lookup strategies. The assessment includes reasoning about using language standard libraries versus custom implementations, concurrency and thread safety considerations, and approaches to testing and validating correctness under edge cases.