Given list of Strings, task is to remove all the strings, which are substrings of other Strings.
Input : test_list = ["Gfg", "Gfg is best", "Geeks", "for", "Gfg is for Geeks"]
Output : ['Gfg is best', 'Gfg is for Geeks']
Explanation : "Gfg", "for" and "Geeks" are present as substrings in other strings.
Input : test_list = ["Gfg", "Geeks", "for", "Gfg is for Geeks"]
Output : ['Gfg is for Geeks']
Explanation : "Gfg", "for" and "Geeks" are present as substrings in other strings.
Method #1 : Using enumerate() + join() + sort()
The combination of above functions can be used to solve this problem. In this, first the sorting is performed on length parameter, and current word is checked with other words, if it occurs as substring, if yes, its excluded from filtered result.
Python3
# Python3 code to demonstrate working of
# Remove Redundant Substrings from Strings List
# Using enumerate() + join() + sort()
# initializing list
test_list = ["Gfg", "Gfg is best", "Geeks", "Gfg is for Geeks"]
# printing original list
print("The original list : " + str(test_list))
# using loop to iterate for each string
test_list.sort(key = len)
res = []
for idx, val in enumerate(test_list):
# concatenating all next values and checking for existence
if val not in ', '.join(test_list[idx + 1:]):
res.append(val)
# printing result
print("The filtered list : " + str(res))
OutputThe original list : ['Gfg', 'Gfg is best', 'Geeks', 'Gfg is for Geeks']
The filtered list : ['Gfg is best', 'Gfg is for Geeks']
Time complexity: O(nlogn), where n is the length of the test_list. The enumerate() + join() + sort() takes O(nlogn) time
Auxiliary Space: O(n), extra space of size n is required
Method #2 : Using list comprehension + join() + enumerate()
The combination of above functions can be used to solve this problem. In this, we perform task in similar way as above just the difference being in more compact way in list comprehension.
Python3
# Python3 code to demonstrate working of
# Remove Redundant Substrings from Strings List
# Using list comprehension + join() + enumerate()
# initializing list
test_list = ["Gfg", "Gfg is best", "Geeks", "Gfg is for Geeks"]
# printing original list
print("The original list : " + str(test_list))
# using list comprehension to iterate for each string
# and perform join in one liner
test_list.sort(key = len)
res = [val for idx, val in enumerate(test_list) if val not in ', '.join(test_list[idx + 1:])]
# printing result
print("The filtered list : " + str(res))
OutputThe original list : ['Gfg', 'Gfg is best', 'Geeks', 'Gfg is for Geeks']
The filtered list : ['Gfg is best', 'Gfg is for Geeks']
The Time and Space Complexity for all the methods are the same:
Time Complexity: O(n)
Space Complexity: O(n)
Method#3: Using Recursive method.
Algorithm
- Sort the list of strings by length.
- Initialize an empty result list.
- For each string in the sorted list: a. Check if the string is a redundant substring of any of the remaining strings in the list (i.e., any string that comes after it in the sorted list). If it is, skip the string and move on to the next one. b. If the string is not redundant, add it to the result list.
- Return the result list.
Python3
def remove_redundant_substrings(strings):
# Base case: if the list is empty or has only one element, return it
if len(strings) <= 1:
return strings
# Sort the list by length to simplify the recursion
strings.sort(key=len)
# Take the first string and remove it from the list
current_string = strings.pop(0)
# Recursively remove redundant substrings from the rest of the list
remaining_strings = remove_redundant_substrings(strings)
# Check if the current string is a redundant substring of any of the remaining strings
for string in remaining_strings:
if current_string in string:
return remaining_strings
# If the current string is not redundant, add it back to the list and return it
remaining_strings.append(current_string)
return remaining_strings
test_list = ["Gfg", "Gfg is best", "Geeks", "Gfg is for Geeks"]
print("The original list : " + str(test_list))
res = remove_redundant_substrings(test_list)
print("The filtered list : " + str(res))
OutputThe original list : ['Gfg', 'Gfg is best', 'Geeks', 'Gfg is for Geeks']
The filtered list : ['Gfg is for Geeks', 'Gfg is best']
The time complexity of this algorithm is O(n^2 * m), where n is the number of strings in the input list and m is the maximum length of a string in the list. The worst case occurs when all the strings are unique and none of them are a substring of any of the others, so we have to check each string against every other string in the list. The sorting step takes O(n log n) time, and the string comparisons take O(m) time each, so the overall time complexity is O(n^2 * m).
The auxiliary space of this algorithm is O(n * m), because we need to store a copy of each string in the input list (which takes O(n * m) space), plus the result list (which can also take up to O(n * m) space if all the strings are unique and none of them are redundant substrings of any of the others
Explore
Python Fundamentals
Python Data Structures
Advanced Python
Data Science with Python
Web Development with Python
Python Practice