Available question text
Design a queue-like data structure that maintains items ordered by most-recent access, supporting operations to enqueue, dequeue/remove, and "touch" an item to move it to the most-recent position. The challenge is to keep these updates and queries efficient (ideally O(1)) while correctly handling duplicates or capacity constraints if specified.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 3 records
Google
Leetcode 1756. Design Most Recently Used Queue
Reported Dec 25, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceMeta
Leetcode 1756. Design Most Recently Used Queue
Reported Apr 7, 2026 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View sourceSquarespace
Leetcode 1756. Design Most Recently Used Queue
Reported Mar 30, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source