Given three strings a, b, and c, determine the shortest string that contains all three given strings as substrings.

If there are multiple valid strings of the same minimum length, return the lexicographically smallest one.

Constraints:

• $1 \leq$ a.length, b.length, c.length $\leq 100$

• a, b, and c 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.