top of page

Validate Stack Sequences

Updated: Mar 25, 2021

Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.

Example 1:

Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
Output: true
Explanation: We might do the following sequence: push(1), push(2), push(3), push(4), pop() -> 4, push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1 

Example 2:

Input: pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
Output: false
Explanation: 1 cannot be popped before 2. 


  • 0 <= pushed.length == popped.length <= 1000

  • 0 <= pushed[i], popped[i] < 1000

  • pushed is a permutation of popped.

  • pushed and popped have distinct values.


Approach 1:

Time Complexity: O(N) Space Complexity: O(N)

class Solution {
    public boolean validateStackSequences(int[] pushed, int[] popped) {
       Stack<Integer> stack = new Stack<>();
        int i=0;
        for(int x:pushed)
            while(!stack.isEmpty() && stack.peek()==popped[i])
        return stack.isEmpty();

Approach 2:

Time Complexity: O(N) Space Complexity: O(1)

class Solution {
    public boolean validateStackSequences(int[] pushed, int[] popped) {
        int i=0,j=0;
        for(int x:pushed)
            while(i>0 && pushed[i-1]==popped[j])
        return i==0;

50 views0 comments

Recent Posts

See All

Minimum Deletions to Make Character Frequencies Unique

A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of characters you need to delete to make s good. The f

Smallest String With A Given Numeric Value

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.


bottom of page