Implementation of a Queue class using two stacks as a challenge for HackerRank

queueWithTwoStacks.js

    class Queue {
        constructor() {
            this.inStack = [];
            this.outStack = [];
        }
        enqueue(element) {
            this.inStack.push(element);
        }
        dequeue() {
            if (!this.outStack.length)
                while (this.inStack.length)
                    this.outStack.push(this.inStack.pop());
            this.outStack.pop();
        }
        print() {
            if (this.outStack.length)
                console.log(this.outStack[this.outStack.length - 1]);
            else if (this.inStack.length)
                console.log(this.inStack[0]);
        }
    }