Use hashing to convert company names in numbers and then for each list check if this is a subset of any other list.

In order to check if a list is a subset of another list, use two pointers technique to get a linear solution for this task. The total complexity will be O(n^2 * m) where n is the number of lists and m is the maximum number of elements in a list.