You are given a string command that consists of a sequence of tokens. A parser interprets the input string by applying the following mappings:

• "G" is interpreted as "G"

• "()" is interpreted as "o"

• "(al)" is interpreted as "al"

Return the final interpreted string after translating all tokens in command.

Constraints:

• $1 \leq$ command.length $\leq 100$

• command consists of "G", "()", and/or "(al)" in some order.

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.