Given two integer arrays pushed and popped, each with distinct values, determine if this sequence of operations could result from an initially empty stack undergoing a series of push and pop operations. Return true if valid, or false otherwise.

Constraints:

• $1 \le$ pushed.length $\le 1000$

• $0 \le$ pushed[i] $\le 1000$

• All the elements of pushed are unique.

• popped.length is equal to pushed.length

• popped is a permutation of pushed.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.