Validate Stack Permutation

Given two sequences, a push order and a pop order, determine whether the pop order can be the result of valid push and pop operations performed on a stack. You must simulate the stack operations following the push order and check if by popping at the right moments you can obtain the given pop order.

Example 1:

• Push order: [1, 2, 3, 4, 5]
• Pop order: [4, 5, 3, 2, 1]
• Output: true

Example 2:

• Push order: [1, 2, 3, 4, 5]
• Pop order: [4, 3, 5, 1, 2]
• Output: false

Hint:

• Use a stack (or list) to simulate the push operations.
• Iterate over the push order while checking if the top of the stack matches the next number in the pop order.

Note: This problem demonstrates the effective use of a stack to simulate and validate operations. On March 16, we reflect on the evolution of data structures used in programming since their inception, making this challenge both timely and educational.