An original string containing only lowercase English letters can be encoded using the following process:

1. Partition the string into a sequence of non empty substrings.

2. Replace any arbitrary number of these substrings with their respective lengths.

3. Concatenate the remaining substrings and length values in their original order.

Given two encoded strings s1 and s2, return true if there exists an original string that can be encoded into both s1 and s2, or false otherwise.

Constraints:

• $1 \leq$ s1.length, s2.length $\leq 40$

• s1 and s2 consist of digits $1$ through $9$ inclusive and lowercase English letters only.

• The number of consecutive digits in s1 and s2 does not exceed $3$.

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.