<pre class="shiki github-dark shaku"><code>/* you can use this Queue which is bundled together with your codeclass Queue { enqueue(element) { // add new element to the queue } peek() { // return the head element } dequeue() { // remove head element from the queue } size() { // return the queue size }}*/// you need to complete the following Stack, using only Queueclass Stack { constructor() { this.queue = new Queue(); } push(element) { const size = this.queue.size(); this.queue.enqueue(element); // Rotate the queue to move the new element to the front for (let i = 0; i &lt; size; i++) { this.queue.enqueue(this.queue.dequeue()); } } peek() { return this.queue.peek(); } pop() { return this.queue.dequeue(); } size() { return this.queue.size(); }}</code></pre>

Simply and lovely

> This is reversed problem of 13. Implement a Queue by using Stack In JavaScript, we could use array to work as both a Stack or a queue. const arr = […