You are given an array of strings, words. Your task is to find the longest string in words such that every prefix of this string is also present in words.

A prefix of a string is any leading substring. For example, the prefixes of "apple" are "a", "ap", "app", and "appl".

1. If multiple valid strings have the same maximum length, return the lexicographically smallest one.

2. If no such string exists, return an empty string "".

Constraints:

• $1 \leq$ words.length $\leq 10^3$

• $1 \leq$ words[i].length $\leq 10^3$

• $1 \leq$ sum(words[i].length) $\leq 10^3$

• words[i] consists only of lowercase English letters.

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.