Shortest Uncommon Substring in an Array
You are given an array arr of size n consisting of non-empty strings.
You are given an array arr of size n consisting of non-empty strings.
Find a string array answer of size n such that:
Return the array answer.
Example 1
Input: arr = ["cab","ad","bad","c"]
Output: ["ab","","ba",""]
Explanation: We have the following: - For the string "cab", the shortest substring that does not occur in any other string is either "ca" or "ab", we choose the lexicographically smaller substring, which is "ab". - For the string "ad", there is no substring that does not occur in any other string. - For the string "bad", the shortest substring that does not occur in any other string is "ba". - For the string "c", there is no substring that does not occur in any other string.
Example 2
Input: arr = ["abc","bcd","abcd"]
Output: ["","","abcd"]
Explanation: We have the following: - For the string "abc", there is no substring that does not occur in any other string. - For the string "bcd", there is no substring that does not occur in any other string. - For the string "abcd", the shortest substring that does not occur in any other string is "abcd".
Constraints
- n == arr.length
- 2 <= n <= 100
- 1 <= arr[i].length <= 20
- arr[i] consists only of lowercase English letters.
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.