Design a thread-safe LRU cache with O(1) get and put.

Answer preview

Every LLD interviewer asks this. Requires O(1) get + O(1) put, evict least-recently-used on capacity. HashMap + Doubly Linked List, guarded by a lock.…