<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]:


        '''


        '''
        max_len = max([len(x) for x in arr])
        sol = [""] * len(arr)

        for size in range(1, max_len+1):
            seen = {}

            for i, x in enumerate(arr):
                for j in range(len(x)-size+1):
                    window = x[j:j+size]
                    if seen.get(window) == None or seen.get(window) == i:
                        seen[window] = i

                    else:
                        seen[window] = -1


            for substr in seen.keys():
                if seen[substr] == -1:
                    continue

                curr = sol[seen[substr]]

                if len(curr) == 0 or (len(substr) <= len(curr) and substr < curr):
                    sol[seen[substr]] = substr


            for i in range(len(arr)):
                if len(sol[i]) == 0 and len(arr[i]) > size:
                    break

                if i == len(arr) - 1:
                    return sol


        return sol
            





        # def get_subarray(s):
        #     output = [s[i:j+1] for i in range(len(s)) for j in range(i, len(s))]
        #     return output


        # answer = [""] * len(arr)

        # for i in range(len(arr)):
        #     subarr = sorted(get_subarray(arr[i]), key=lambda x: (len(x), x))

        #     for substr in subarr:
        #         unique = True
                
        #         for j in range(len(arr)):
        #             if j != i and substr in arr[j]:
        #                 unique = False
        #                 break

        #         if unique:
        #             answer[i] = substr
        #             break

        # return answer
        '''
        ["cab","ad","bad","c"]

        

        '''



            

        
        
16800