Stack

Ex-Meta Staff Engineer

JSTS

Implement a stack data structure in JavaScript that contains the following operations:

new Stack(): Creates an instance of a Stack class that doesn't contain any items. The constructor does not accept any arguments.
push(): Pushes an item onto the top of the stack and returns the new length of the stack. Required time complexity: O(1).
pop(): Removes an item at the top of the stack and returns that item. Required time complexity: O(1).
isEmpty(): Determines if the stack is empty. Required time complexity: O(1).
peek(): Returns the item at the top of the stack without removing it from the stack. Required time complexity: O(1).
length(): Returns the number of items in the stack. Required time complexity: O(1).

Examples

const stack = new Stack();
stack.isEmpty(); // true
stack.push(1);
stack.push(2);
stack.length(); // 2
stack.push(3);
stack.peek(); // 3
stack.pop(); // 3
stack.isEmpty(); // false

Coding and submission is not supported on mobile devices. Use a wider screen to practice solving this question within the editor.

Stack

Yangshun Tay

Ex-Meta Staff Engineer

JSTS

Implement a stack data structure in JavaScript that contains the following operations:

new Stack(): Creates an instance of a Stack class that doesn't contain any items. The constructor does not accept any arguments.
push(): Pushes an item onto the top of the stack and returns the new length of the stack. Required time complexity: O(1).
pop(): Removes an item at the top of the stack and returns that item. Required time complexity: O(1).
isEmpty(): Determines if the stack is empty. Required time complexity: O(1).
peek(): Returns the item at the top of the stack without removing it from the stack. Required time complexity: O(1).
length(): Returns the number of items in the stack. Required time complexity: O(1).

Examples

const stack = new Stack();
stack.isEmpty(); // true
stack.push(1);
stack.push(2);
stack.length(); // 2
stack.push(3);
stack.peek(); // 3
stack.pop(); // 3
stack.isEmpty(); // false

Try these questions next

Queue

Similar Questions

Queue

Solution

Array-based solution

The stack abstract data type can be easily implement in JavaScript with JavaScript Arrays. The main thing to note when implementing stacks is that that the operations should be O(1). Thankfully, JavaScript Array's push() and pop() operations are O(1) and the method signatures match the Stack's. Many of the methods are just simple wrappers around Array methods.

export default class Stack {
  constructor() {
    this._items = [];
  }

  /**
   * Pushes an item onto the top of the stack.
   * @param {*} item The item to be pushed onto the stack.
   * @return {number} The new length of the stack.
   */
  push(item) {
    return this._items.push(item);
  }

  /**
   * Remove an item at the top of the stack.
   * @return {*} The item at the top of the stack if it is not empty, `undefined` otherwise.
   */
  pop() {
    return this._items.pop();
  }

  /**
   * Determines if the stack is empty.
   * @return {boolean} `true` if the stack has no items, `false` otherwise.
   */
  isEmpty() {
    return this.length() === 0;
  }

  /**
   * Returns the item at the top of the stack without removing it from the stack.
   * @return {*} The item at the top of the stack if it is not empty, `undefined` otherwise.
   */
  peek() {
    return this.isEmpty() ? undefined : this._items[this.length() - 1];
  }

  /**
   * Returns the number of items in the stack.
   * @return {number} The number of items in the stack.
   */
  length() {
    return this._items.length;
  }
}

Linked list-based solution

Stacks can also be implemented with singly-linked lists which are essentially a chain of connected nodes. To do that, we need to create a Node class that has a prev pointer, a reference to the Node below if it's not the bottom item of the stack.

push()-ing involves creating a new Node and pointing the current top of the stack to that new Node's prev field and updating a reference to the new top of the stack. pop()-ing is the reverse where we find the prev node of the current top and set it to be the new top of the stack.

Since the time complexity of length() has to be O(1) and counting the number of items in a linked list will take O(n), we need to separately track the number of items in the list with a _length instance property and update it within the push() and pop() methods.

class Node {
  constructor(value) {
    this.value = value;
    this.prev = null;
  }
}

export default class Stack {
  constructor() {
    this._top = null;
    this._length = 0;
  }

  /**
   * Pushes an item onto the top of the stack.
   * @param {*} item The item to be pushed onto the stack.
   * @return {number} The new length of the stack.
   */
  push(item) {
    const node = new Node(item);
    node.prev = this._top;
    this._top = node;
    this._length++;
    return this._length;
  }

  /**
   * Remove an item at the top of the stack.
   * @return {*} The item at the top of the stack if it is not empty, `undefined` otherwise.
   */
  pop() {
    if (this.isEmpty()) {
      return undefined;
    }

    const node = this._top;
    this._top = node.prev;
    node.prev = null;
    this._length--;
    return node.value;
  }

  /**
   * Determines if the stack is empty.
   * @return {boolean} `true` if the stack has no items, `false` otherwise.
   */
  isEmpty() {
    return this._length === 0;
  }

  /**
   * Returns the item at the top of the stack without removing it from the stack.
   * @return {*} The item at the top of the stack if it is not empty, `undefined` otherwise.
   */
  peek() {
    return this.isEmpty() ? undefined : this._top.value;
  }

  /**
   * Returns the number of items in the stack.
   * @return {number} The number of items in the stack.
   */
  length() {
    return this._length;
  }
}

Stack

Examples

Stack

Examples

Try these questions next

Similar Questions

Solution

Array-based solution

Linked list-based solution

Edge cases

Techniques

You must be signed in to view your submissions

Loading editor

Loading editor

Loading tests

JavaScript Console

Loading tests