Design a data structure backed by a deque that supports push front, push back, pop front, pop back, and O(1) access by logical index. Explain how an offset and index mapping can preserve stable logical indexing as elements are removed from the front. ### Constraints & Assumptions - The operations are in memory. - Logical indices refer to insertion positions unless clarified. - O(1) average access is required. - The exact language can provide deque iterators or array-like blocks. ### Clarifying Questions to Ask - Should indices remain stable after pops? - Are duplicate values allowed? - Do we access by current position or original logical index? - What should happen for removed indices? - Are iterators invalidated by deque operations in the chosen language? ### What a Strong Answer Covers ```premium-lock What a Strong Answer Covers ``` ### Follow-up Questions - How would you implement this without stable iterators? - How would memory be reclaimed? - How would concurrency affect the map and deque? - How would random deletion by index work?