Open In App

Python | Get matching substrings in string

Last Updated : 24 Mar, 2023
Comments
Improve
Suggest changes
1 Like
Like
Report

The testing of a single substring in a string has been discussed many times. But sometimes, we have a list of potential substrings and check which ones occur in a target string as a substring. Let's discuss certain ways in which this task can be performed. 
 

Method #1: Using list comprehension 
Using list comprehension is the naive and brute force method to perform this particular task. In this method, we try to get the matching string using the "in" operator and store it in the new list. 


Output
The original string is : GfG is good website
The original list is : ['GfG', 'site', 'CS', 'Geeks', 'Tutorial']
The list of found substrings : ['GfG', 'site']

Method #2: Using filter() + lambda 
This task can also be performed using the filter function which performs the task of filtering out the resultant strings that is checked for existence using the lambda function. 


Output
The original string is : GfG is good website
The original list is : ['GfG', 'site', 'CS', 'Geeks', 'Tutorial']
The list of found substrings : ['GfG', 'site']

Method #3 : Using find() method.
find() method returns the position of the string passed as an argument in the given string or else returns -1


Output
The original string is : GfG is good website
The original list is : ['GfG', 'site', 'CS', 'Geeks', 'Tutorial']
The list of found substrings : ['GfG', 'site']

Method #4 : Using re

In this approach using the re (regular expression) module, we import the re module and use its search() function to check for the presence of a substring in the target string. The search() function returns a match object if the substring is found, and None if it is not found. We can use this behavior to filter the list of potential substrings and only keep the ones that are present in the target string.


Output
The original string is : GfG is good website
The original list is : ['GfG', 'site', 'CS', 'Geeks', 'Tutorial']
The list of found substrings : ['GfG', 'site']

The time complexity of the approach using the re module is O(n * m), where n is the length of the target string and m is the number of substrings in the list of potential substrings.

This is because for each substring in the list, we are searching the entire target string to see if the substring is present.

The auxiliary space is O(n), as we are creating a new list of substrings that are found in the target string, and this list will have a length of at most n.

Method #5 : Using index() method.

In python we index ( ) returns matching substring index()" method returns the index of the first occurrence of the substring in the string "index()" method raises a ValueError exception, which is handled by the try-except block.


Output
The original string is: GfG is good website
The original list is: ['GfG', 'site', 'CS', 'Geeks', 'Tutorial']
The list of found substrings: ['GfG', 'site']

The time complexity of this program is O(n * m)

The auxiliary space of this program is O(n)

Method #6 : Using operator.contains() method

  1. Initiate a for loop to traverse list of substrings
  2. Check whether each substring is present in original string using operator.contains()
  3. If present append that substring to output list
  4. Display output list

Output
The original string is : GfG is good website
The original list is : ['GfG', 'site', 'CS', 'Geeks', 'Tutorial']
The list of found substrings : ['GfG', 'site']

Time Complexity : O(M*N) M -length of string N-length of substring list

Auxiliary Space : O(N) N - number of substrings present in string


Next Article
Practice Tags :

Similar Reads