Practice
JavaScriptData StructuresReactConcepts
Sign in
← Back to problems

Queue Order (FIFO)

Queueseasy

A queue is first-in-first-out. Implement `queueOps(values)` that enqueues every value then dequeues them all, returning the dequeue order.

Sample tests

Input: queueOps([1,2,3])
Output: [1,2,3]
Input: queueOps([])
Output: []

+ 1 hidden test run on Submit.

Hints

Common pitfalls
  • pop removes from the end, which would make it a stack.

Learning resources

  • Wikipedia: Data structure
Approach & explanation (try first)

A queue dequeues in the same order items were enqueued. O(n) overall (shift is O(n) on arrays; a real queue uses a linked structure for O(1)).

Loading...
⌘/Ctrl + Enter

Run your code to see results.