Given a string expression representing a valid arithmetic expression made of non negative integers and the binary operators +, -, and *, return all possible results from computing the expression by inserting parentheses in every possible way.

The returned list may be in any order, and duplicate results are allowed if different parenthesizations produce the same value.

Note: The input contains only numbers and the operators +, -, and *, and the numbers are written without an explicit sign.

Constraints:

• $1 \leq$ expression.length $\leq 20$

• expression consists of digits and the operator '+', '-', and '*'

• All integer values in expression are in the range $[0, 99]$

• The integer values in expression do not have a leading '-' or '+' denoting the sign

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.