Find longest substring in an array of strings and remove it from all the elements in the array [closed]

Answer 1

Find the maximum number of times a substring of length 1 appears. This is a simple O(n^2) search. Call this maximum number of occurrence K.

In your example, this is "1", "0", and K=5.

Now you know that all substrings of length 2 cannot appear in more than K input strings. Also, any substring that occurs K times must be made of the length 1 substrings that occured K times. Search the length 1 substrings for substrings of length 2 that exist K times, this is again a simple O(n^2) search.

Repeat for longer lengths until no more substrings exist in K inputs.