Validate Stack Sequences Python Solution

lcpy gen -n 946   # by problem number
lcpy gen -s validate_stack_sequences   # by problem name

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

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

class Solution:
    # Time: O(n)
    # Space: O(n)
    def validate_stack_sequences(self, pushed: list[int], popped: list[int]) -> bool:
        stack: list[int] = []
        pop_index = 0
        for value in pushed:
            stack.append(value)
            while stack and stack[-1] == popped[pop_index]:
                stack.pop()
                pop_index += 1
        return pop_index == len(popped)