Implement a Queue class with `enqueue(val)`, `dequeue()`, `front()`, `isEmpty()`, and `size()` methods.
Problem Statement
Implement a Queue class with `enqueue(val)`, `dequeue()`, `front()`, `isEmpty()`, and `size()` methods.
Complexity
Time Complexity: -
Space Complexity: -
Hints
š” Hint 1:
A queue follows First-In-First-Out (FIFO) principle.
š” Hint 2:
Use an array. enqueue adds to end, dequeue removes from front.
š” Hint 3:
Use push() for enqueue and shift() for dequeue.
ā
Solution:
```javascript
class Queue {
constructor() { this.items = []; }
enqueue(val) { this.items.push(val); }
dequeue() { return this.items.shift(); }
front() { return this.items[0]; }
isEmpty() { return this.items.length === 0; }
size() { return this.items.length; }
}
```