You are given an integer array target and an integer n.

You have an empty stack and a stream of integers from $1$ to n in strictly increasing order. In each step, you process the next integer from the stream using the following operations:

• "Push": Pushes the current integer from the stream onto the stack.

• "Pop": Removes the integer at the top of the stack.

You must build the target array using the stack such that the elements in the stack from bottom to top form target. You must stop performing operations immediately once the stack matches target.

Return the list of operations performed to build target.

Constraints:

• $1 \leq$ target.length $\leq 100$

• $1 \leq$ n $\leq 100$

• $1 \leq$ target[i] $\leq$ n

• target is strictly increasing.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.