You are given three strings s1, s2, and s3. In one operation, you can choose any of the three strings and remove its rightmost character.

Return the minimum number of operations required to make all three strings equal and non empty. If it is impossible to make them equal, return $-1$.

Constraints:

• $1 \leq$ s1.length, s2.length, s3.length $\leq 100$

• s1, s2, and s3 consist only of lowercase English letters.

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.