Lumos | Software Engineer Intern | Coding | Phone Screen

Question 1: Implement an LRU Cache Design a data structure that simulates a Least Recently Used (LRU) cache with the following operations: Requirements Both operations must run in O(1) time complexity To achieve O(1) operations, we combine: | Structure | Purpose | | | | | Hash Map (dict) | Fast lookup by key | | Doubly Linked List | Track usage order | Why key value pairs? We must: Locate items quickly → use key Stor...