Problem Journey

Build an Array With Stack Operations

Easy | Array Stack Simulation | Solved: Feb 01, 2026
View on LeetCode →

Complexity Analysis

Time Complexity: O(n)

Space Complexity: O(1)

Problem Description

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

You have an empty stack with the two following operations:

“Push”: pushes an integer to the top of the stack. “Pop”: removes the integer on the top of the stack. You also have a stream of the integers in the range [1, n].

Use the two stack operations to make the numbers in the stack (from the bottom to the top) equal to target. You should follow the following rules:

If the stream of the integers is not empty, pick the next integer from the stream and push it to the top of the stack. If the stack is not empty, pop the integer at the top of the stack. If, at any moment, the elements in the stack (from the bottom to the top) are equal to target, do not read new integers from the stream and do not do more operations on the stack. Return the stack operations needed to build target following the mentioned rules. If there are multiple valid answers, return any of them.

Approach

Simulation with Early Exit

Solution

import java.util.ArrayList;
import java.util.List;

class Solution {
    public List<String> buildArray(int[] target, int n) {
        List<String> result = new ArrayList<>();
        int streamNum = 1;
        int targetIndex = 0;

        while (targetIndex < target.length) {
            result.add("Push");

            if (target[targetIndex] == streamNum) {
                targetIndex++;
            } else {

                result.add("Pop");
            }
            streamNum++;
        }

        return result;
    }
}