Given two strings s and t, each representing a non negative rational number, return true if and only if they represent the same number. The strings may use parentheses to denote the repeating part of the rational number.

A rational number can be represented using up to three parts: <IntegerPart>, <NonRepeatingPart>, and <RepeatingPart>. The number will be expressed in one of the following three formats:

• <IntegerPart>

  • For example, $12$, $0$, and $123$.

• <IntegerPart><.><NonRepeatingPart>

  • For example, $0.5$, $1.$, $2.12$, and $123.0001$.

• <IntegerPart><.><NonRepeatingPart><(><RepeatingPart><)>

  • For example, $0.1(6)$, $1.(9)$, $123.00(1212)$.

The repeating portion of a decimal expansion is conventionally denoted within a pair of round brackets. For example:

$1/6 = 0.16666666... = 0.1(6) = 0.1666(6) = 0.166(66)$

Note: The same rational number may have multiple valid representations using different placements of the repeating block.

Constraints:

• Each part consists only of digits.

• The <IntegerPart> does not have leading zeros (except for the zero itself).

• $1 \leq$ <IntegerPart>.length $\leq 4$

• $0 \leq$ <NonRepeatingPart>.length $\leq 4$

• $1 \leq$ <RepeatingPart>.length $\leq 4$

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 on how to solve this problem.

Implement your solution in the following coding playground.