Stack presented by Easy LeetCode

class Stack<T> {
  private items: T[] = [];

  get size() {
    return this.items.length;
  }

  get empty() {
    return this.size === 0;
  }

  get top() {
    return this.items[0];
  }

  push(item: T) {
    this.items.push(item);
  }

  pop() {
    if (this.empty) {
      throw new StackUnderflowError();
    }

    const item = this.items.pop();
    return item;
  }
}

class StackUnderflowError extends Error {
  constructor() {
    super("Stack is empty");
  }
}

Use Stack on LeetCode

Copy this snippet and paste it to the bottom of your LeetCode editor so that you can use the Stack.

Don’t use it where the problem itself is to implement a Stack.