JS Practice — Built-in Objects

Array.prototype.shift() — dequeue from a queue

📖 Usage Example

const queue = []
queue.push('first')
queue.push('second')
queue.shift()  // → 'first'  (FIFO)

Use push() and shift() together to implement a first-in, first-out (FIFO) queue.

Implementing a queue with shift

A queue is a FIFO structure: elements are added to the back (push) and removed from the front (shift).

const queue = ['first', 'second', 'third']
const served = queue.shift() // 'first'

💡 Hints (2)