Data Structures/Queue
FIFOsequentialscheduling
Press play to start
1void enqueue(int val) {
2 queue[rear++] = val;
3}
Step 1/0

Practice

LeetCode·#232 Implement Queue Using StacksEasyHackerRank·Queue Using Two StacksMediumNeetCode·Implement Queue Using StacksEasy
OperationBestAverageWorst
enqueueO(1)O(1)O(1)
dequeueO(1)O(1)O(1)
peekO(1)O(1)O(1)
searchO(1)O(n)O(n)
SpaceO(n)