Stack push pop sequence
Given two integer sequences pushed and popped, each a permutation of distinct values with no repeats, determine whether popped could be the result of a sequence of push and pop operations on an initially empty stack, where the values are pushed strictly in the order given by pushed. Return True or False. Both sequences have the same length, 0 to 1000.
Implement
validate_stack_sequences(pushed: list[int], popped: list[int]) → boolExamples
in
[[1,2,3,4,5],[4,5,3,2,1]]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[[1,2,3,4,5],[4,5,3,2,1]]truenot run yetsample