Available question text
Implement a fixed-size circular queue (ring buffer) supporting enqueue, dequeue, Front/Rear, isEmpty and isFull operations without using built-in queue types. The core challenge is to maintain head/tail indices (and size or a reserved slot) with wrap-around so all operations run in O(1) while correctly distinguishing empty vs full.
Related questions
Continue with questions that share topics or the same question type.
- Design Browser History
Coding · Array · Data Stream · Design
- Design HashMap
Coding · Array · Design · Hash Function
- Design Hit Counter
Coding · Array · Binary Search · Data Stream
- First Unique Number
Coding · Array · Data Stream · Design
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 622. Design Circular Queue
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
NVIDIA
Design Circular Queue
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 73.7. This is not an interview probability.
View source