Learn essential coding patterns to answer problems and prepare for tech companies' interviews.

Ace the JavaScript Coding Interview

This module teaches us the underlying patterns behind common coding interview questions. By learning these essential patterns, we'll be able to unpack and answer any problem the right way—just by assessing the problem statement. This approach was created by FAANG hiring managers to help us prepare for the typical rounds of interviews at major tech companies like Apple, Google, Meta, Microsoft, and Amazon.

By the end of this module, we'll have the skills we need to unlock even the most challenging questions, grok the coding interview, and level up our career with confidence.

Coding Interview Patterns

# Statement
Design a custom queue, **MyQueue**, using only two stacks. Implement the **Push()**, **Pop()**, **Peek()**, and **Empty()** methods:

* **Void Push(int x):** Pushes element at the end of the queue.
* **Int Pop():** Removes and returns the element from the front of the queue.
* **Int Peek():** Returns the element at the front of the queue.
* **Boolean Empty():** Returns TRUE if the queue is empty. Otherwise FALSE.

You are required to only use the standard stack operations, which means that only the **Push()** to top, **Peek()** and **Pop()** from the top, **Size()**, and **Is Empty()** operations are valid.

> **Note:** In some interview questions, **Void Push(int x)** and **Int Pop()** might be referred to as **Void Enqueue(int x)** and **Int Dequeue()**, respectively.

**Constraints:**
* $1 <=$ `x` $<= 100$
* A maximum of $100$ calls can be made to **Push()**, **Pop()**, **Peek()**, and **Empty()**.

* The **Pop()** and **Peek()** methods will always be called on non-empty stacks.

Try to solve the Implement Queue Using Stacks problem.