You are given an integer array nums. The adjacent elements in nums represent a sequence of floating point divisions, evaluated from left to right. For example, [2, 3, 4] corresponds to the expression $2 / 3 / 4$.

You may add any number of parentheses at any position to change the precedence of the operations. Determine the placement of parentheses that maximizes the evaluated result of the expression.

Return the expression that produces the maximum value as a string.

Note: Any redundant parentheses that do not influence the order of operations must be omitted.

Constraints:

• $1 \leq$ nums.length $\leq 10$

• $2 \leq$ nums[i] $\leq 1000$

• There is only one optimal division for the given input.

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.