Given an array of strings words, return the longest string in words that can be constructed one character at a time by other strings in words.

If multiple qualifying strings have the same maximum length, return the one that is lexicographically smallest. If no such string exists, return an empty string "".

Constraints:

• $1 \leq$ words.length $\leq 1000$

• $1 \leq$ words[i].length $\leq 30$

• words[i] consists 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.