The file system records crawler log operations for navigating directories. Initially, you begin in the main folder.

You are given an array of strings logs, where logs[i] represents the operation performed at step $i$:

• "../": Navigate up to the parent folder of the current directory. If you are already at the main folder, remain where you are.

• "./": Remain in the current directory.

• "x/": Navigate into the child folder named x (which is guaranteed to exist).

Return the minimum number of operations required to navigate back to the main folder after processing all the logs.

Constraints:

• $1 \leq$ logs.length $\leq 10^3$

• $2 \leq$ logs[i].length $\leq 10$

• logs[i] contains lowercase English letters, digits, '.', and '/'

• logs[i] follows the specified format

• Folder names consist of lowercase English letters and digits

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.