DSA using JavaScript

Queue

class MyQueue {
  constructor() {
    this.stack1 = []; // Stack for pushing elements
    this.stack2 = []; // Stack for popping/peeking elements
  }

  // Push element to the back of the queue
  push(x) {
    this.stack1.push(x);
  }

  // Removes the element from the front of the queue
  pop() {
    if (this.stack2.length === 0) {
      while (this.stack1.length > 0) {
        this.stack2.push(this.stack1.pop());
      }
    }
    return this.stack2.pop();
  }

  // Returns the element at the front of the queue
  peek() {
    if (this.stack2.length === 0) {
      while (this.stack1.length > 0) {
        this.stack2.push(this.stack1.pop());
      }
    }
    return this.stack2[this.stack2.length - 1];
  }

  // Returns true if the queue is empty, false otherwise
  empty() {
    return this.stack1.length === 0 && this.stack2.length === 0;
  }
}

// Example Usage
const myQueue = new MyQueue();
myQueue.push(1); // Queue: [1]
myQueue.push(2); // Queue: [1, 2]
console.log(myQueue.peek());  // Output: 1
console.log(myQueue.pop());   // Output: 1
console.log(myQueue.empty()); // Output: false