Question

You are given a list of words sorted lexicographically according to an unknown alphabet of lowercase letters. Derive an order of the letters that is consistent with the sorting, and return it as a string. If multiple valid orders exist, return the one that is lexicographically smallest by normal English letter order among available choices at each step. Return an empty string if no valid order exists (the input is internally contradictory, including the case where a longer word precedes its own prefix).