Implement Cache and Key-Value Store

No, you typically do not need to solve both fully in one hour — unless the interviewer explicitly plans a two-part session. These look like two separate interview problems: Part 1: LRU Bounded Cache is already a complete 30–45 minute coding problem. It requires a hash map plus a doubly linked list to get O(1) get/put with eviction. Part 2: In-Memory Key-Value Store is also a complete problem. Implementing a hash table from scratch with separate chaining and resizing can…