The school cafeteria serves circular and square sandwiches, represented by $0$ and $1$ respectively. All students stand in a queue, with each student possessing a preference for either a circular ($0$) or square ($1$) sandwich.

The sandwiches are arranged in a stack. At each step, if the student at the front of the queue prefers the sandwich on top of the stack, they take it and leave the queue. Otherwise, they leave the sandwich on the stack and move to the end of the queue.

This process repeats until none of the students remaining in the queue want to take the top sandwich, making it impossible for anyone to proceed.

Return the number of students who are unable to eat.

Constraints:

• $1 \le$ students.length, sandwiches.length $\le 100$

• students.length $==$ sandwiches.length

• sandwiches[i] is either $0$ or $1$.

• students[i] is either $0$ or $1$.

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.