<p>You are given an array <code>arr</code> of size <code>n</code> consisting of <strong>non-empty</strong> strings.</p>

<p>Find a string array <code>answer</code> of size <code>n</code> such that:</p>

<ul>
	<li><code>answer[i]</code> is the <strong>shortest</strong> <span data-keyword="substring">substring</span> of <code>arr[i]</code> that does <strong>not</strong> occur as a substring in any other string in <code>arr</code>. If multiple such substrings exist, <code>answer[i]</code> should be the <span data-keyword="lexicographically-smaller-string">lexicographically smallest</span>. And if no such substring exists, <code>answer[i]</code> should be an empty string.</li>
</ul>

<p>Return <em>the array </em><code>answer</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> arr = [&quot;cab&quot;,&quot;ad&quot;,&quot;bad&quot;,&quot;c&quot;]
<strong>Output:</strong> [&quot;ab&quot;,&quot;&quot;,&quot;ba&quot;,&quot;&quot;]
<strong>Explanation:</strong> We have the following:
- For the string &quot;cab&quot;, the shortest substring that does not occur in any other string is either &quot;ca&quot; or &quot;ab&quot;, we choose the lexicographically smaller substring, which is &quot;ab&quot;.
- For the string &quot;ad&quot;, there is no substring that does not occur in any other string.
- For the string &quot;bad&quot;, the shortest substring that does not occur in any other string is &quot;ba&quot;.
- For the string &quot;c&quot;, there is no substring that does not occur in any other string.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> arr = [&quot;abc&quot;,&quot;bcd&quot;,&quot;abcd&quot;]
<strong>Output:</strong> [&quot;&quot;,&quot;&quot;,&quot;abcd&quot;]
<strong>Explanation:</strong> We have the following:
- For the string &quot;abc&quot;, there is no substring that does not occur in any other string.
- For the string &quot;bcd&quot;, there is no substring that does not occur in any other string.
- For the string &quot;abcd&quot;, the shortest substring that does not occur in any other string is &quot;abcd&quot;.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == arr.length</code></li>
	<li><code>2 &lt;= n &lt;= 100</code></li>
	<li><code>1 &lt;= arr[i].length &lt;= 20</code></li>
	<li><code>arr[i]</code> consists only of lowercase English letters.</li>
</ul>

class Solution:
    def shortestSubstrings(self, arr: List[str]) -> List[str]:

        def compare_strings(st1,st2):
            p = 0

            while p<len(st1):
                if st1[p] != st2[p]:
                    if ord(st1[p])>ord(st2[p]):
                        return True
                    else:
                        return False
                elif st1[p]==st2[p]:
                    p+=1
            return False
                    
        substrings = defaultdict(set)
        word_to_substrings_map = defaultdict(list)
        def create_subs(word,idx):
            len_ = 1
            while len_!=len(word)+1:
                for i in range(len(word)-len_+1):
                    subst_ = word[i:i+len_]
                    word_to_substrings_map[word].append(subst_)
                    substrings[subst_].add(idx)
                len_+=1
        for i,word in enumerate(arr):
            create_subs(word,i)
        print(substrings)
        res = [""]*len(arr)
        for i,word in enumerate(arr):
            word_subs = word_to_substrings_map[word]
            for subs in word_subs:
                if len(substrings[subs]) == 1:
                    print(substrings[subs],subs)
                   # print(len(res[i])==len(subs) and compare_strings(res[i],subs),res[i],subs)
                    if res[i]=='' or len(res[i])>len(subs) or (len(res[i])==len(subs) and compare_strings(res[i],subs)):
                        res[i] = subs
        return res

      

            
        

                


            

        
526