Python | Remove sublists that are present in another sublist
Given a list of lists, write a Python program to remove sublists from the given list of lists that are present in another sublist.
Input : [['a', 'b', 'c'], ['a', 'c'], ['a', 'b', 'c'], ['d']] Output : [['a', 'b', 'c'], ['d']] Input : [, [1, 2], [1, 2, 3], , [0, 1]] Output : [[1, 2, 3], [0, 1]]
Approach #1 : Using Python Set (If order of list doesn’t matter) This approach makes use of Python sets. Create two empty lists ‘curr_res’ to store current sublist and ‘result’ to store the finalized sublists. Convert the sub-lists in the given list of lists to sets and sort them by length in reverse order, so that you can iterate through them and add each set to the curr_res only if it is not a subset of any of the existing sets in the curr_res. The only drawback of this approach is that it may produce the result in an unordered way(Since sets are unordered).
[['c', 'b', 'a'], ['d']]
Approach #2 : Using Python Dictionary (If order of list matters) Dict may not always produce ordered output, therefore you can use OrderedDict from collections module.
[['a', 'b', 'c'], ['d']]
Approach #3 : using issubset()+list comprehension+enumerate()
Alternatively, you can use a list comprehension to create a new list that contains only the unique sublists, like this:
[['a', 'b', 'c'], ['d']] [[1, 2, 3], [0, 1]]
This code defines a function remove_duplicate_sublists() that removes duplicate sublists and sublists that are present in another sublist from a list of lists. It first uses a list comprehension to create a new list with unique sublists by iterating over the sublists in the original list and checking if each sublist is not in the preceding sublists. It then uses a second list comprehension to filter out the sublists that are present in another sublist by using the issubset() method of the set() function. The resulting list is returned as the result.
The time complexity of this code is O(n^2), because it involves nested loops over the sublists in the list of lists. The space complexity is O(n), because it involves storing a list of n sublists in memory.