Implement In-Memory Key-Value Store With Expiration
Design and implement an in-memory key-value store that supports basic operations (get, put, delete) with automatic key expiration based on TTL (time-to-live). The implementation should efficiently handle expired key cleanup and provide O(1) average time complexity for core operations.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Mid October, 2026
OA a full on Machine Coding round. Wasn't concerned with time complexity as much as correctness
Late September, 2026
Followups regarding handling TTL in external job, adding memory bounds (like LRU, or FIFO) and extanding to more nodes (redis-like)
Late September, 2026
Implement the `Range` method to return keys and values within a given range, sorted alphabetically.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.