Python – Wildcard Substring search
Last Updated :
09 Apr, 2023
Sometimes, while working with Python Strings, we have problem in which, we need to search for substring, but have some of characters missing and we need to find the match. This can have application in many domains. Lets discuss certain ways in which this task can be performed.
Method #1 : Using re.search() This is one of the way in which this task can be performed. In this, we feed the regex compile with the substring and search for it using main string in search().
Python3
import re
test_str = 'geeksforgeeks is best for geeks'
print("The original string is : " + str(test_str))
sub_str = '..st'
temp = re.compile(sub_str)
res = temp.search(test_str)
print("The substring match is : " + str(res.group(0)))
|
Output :
The original string is : geeksforgeeks is best for geeks
The substring match is : best
Method #2 : Using re.finditer() This is yet another way to solve this problem. In this, we can also extract the position of match if required.
Python3
import re
test_str = 'geeksforgeeks is best for geeks'
print("The original string is : " + str(test_str))
sub_str = '..st'
temp = re.compile(sub_str)
res = temp.search(test_str)
print("The substring match is : " + str(res.group(0)))
|
Output :
The original string is : geeksforgeeks is best for geeks
The substring match is : best
The Time and Space Complexity for all the methods are the same:
Time Complexity: O(n)
Space Complexity: O(n)
Method #3 : Here’s another approach that uses the re library and the re.findall method. It is similar to the re.search method, but re.findall returns a list of all non-overlapping matches as separate strings.
Python3
import re
test_str = 'geeksforgeeks is best for geeks'
print("The original string is : " + str(test_str))
sub_str = '..st'
temp = re.compile(sub_str)
res = temp.findall(test_str)
print("The substring match(es) are: " + str(res))
|
Output
The original string is : geeksforgeeks is best for geeks
The substring match(es) are: ['best']
The time and space complexity for this approach is the same as the previous methods:
Time Complexity: O(n)
Auxiliary Space: O(n)
Method #4 : Using split(),replace(),endswith(),join() methods
Approach
- Splitted the given string using split()
- Replaced . with empty string in sub_str(using replace())
- Initiated a for loop to traverse the list
- Checked whether the length of element is equal to initial substring length and whether the element endswith replaced substring(using endswith())
- If True append such elements to output list
- Finally joined the output and displayed it(using join())
Python3
test_str = 'geeksforgeeks is best for geeks'
print("The original string is : " + str(test_str))
sub_str = '..st'
x=test_str.split()
res=[]
y=len(sub_str)
sub_str=sub_str.replace(".","")
for i in x:
if len(i)==y and i.endswith(sub_str):
res.append(i)
print("The substring match is : " + "".join(res))
|
Output
The original string is : geeksforgeeks is best for geeks
The substring match is : best
Time Complexity: O(n)
Auxiliary Space: O(n)
Method #5 : Using string slicing and a list comprehension
1. Initialize the string and the pattern to search for.
2. Print the original string.
3. Use a list comprehension to create a list of all substrings that match the pattern.
a. For each possible starting index i in the original string, extract a substring of length equal to the length of the pattern.
b. Check if each character in the substring matches the corresponding character in the pattern, or if the pattern character is a wildcard “.”.
c. If all characters match or are wildcards, add the substring to the list of matches.
4. If there is at least one match, print the first one.
Python3
test_str = 'geeksforgeeks is best for geeks'
sub_str = '..st'
print("The original string is : " + str(test_str))
matches = [test_str[i:i+len(sub_str)] for i in range(len(test_str) - len(sub_str) + 1) if all(a == b or b == '.' for a, b in zip(test_str[i:i+len(sub_str)], sub_str))]
if len(matches) > 0:
print("The substring match is : " + matches[0])
|
Output
The original string is : geeksforgeeks is best for geeks
The substring match is : best
The time complexity : O(nm), where n is the length of the original string test_str and m is the length of the substring sub_str. The code uses a list comprehension to iterate over all possible starting indices of the substring and check if the characters match the pattern using the zip function. Since the zip function has a time complexity of O(m) and the list comprehension is repeated n-m+1 times, the overall time complexity is O(nm).
The auxiliary space :O(k), where k is the number of substring matches found. This is because the code stores all matching substrings in the matches list. Since the maximum number of matching substrings is limited to the number of possible starting indices, which is n-m+1, the space complexity is O(n-m+1), which is equivalent to O(n).
Method #6: Using list comprehension and string comparison without zip()
Steps:
- Use a list comprehension to iterate through the input string and generate a list of substrings that match the given wildcard pattern. In this case, we use string slicing and endswith() method for comparison.
- Extract the matched substring from the list of matches. We take the first match from the list, if any, otherwise set the result to None.
- Print the result.
Python3
test_str = 'geeksforgeeks is best for geeks'
print("The original string is : " + str(test_str))
sub_str = '..st'
matches = [test_str[i:i+len(sub_str)] for i in range(len(test_str)-len(sub_str)+1) if test_str[i:i+len(sub_str)].endswith(sub_str[-1])]
res = matches[0] if matches else None
print("The substring match is : " + str(res))
|
Output
The original string is : geeksforgeeks is best for geeks
The substring match is : best
Time Complexity: O(n), where n is the length of the test string.
Auxiliary Space: O(1).
Similar Reads
Python - String till Substring
When working with Python strings, we may encounter a situation where we need to extract a portion of a string that starts from the beginning and stops just before a specific substring. Let's discuss certain ways in which we can do this. Using split()The split() method is a simple and efficient way t
3 min read
Python Extract Substring Using Regex
Python provides a powerful and flexible module called re for working with regular expressions. Regular expressions (regex) are a sequence of characters that define a search pattern, and they can be incredibly useful for extracting substrings from strings. In this article, we'll explore four simple a
2 min read
Python - Word starting at Index
Sometimes, while working with Python, we can have a problem in which we need to extract the word which is starting from a particular index. This can have a lot of applications in school programming. Let's discuss certain ways in which this task can be performed. Method #1: Using a loop This is a bru
2 min read
Python - Test substring order
Given two strings, check if substring characters occur in correct order in string. Input : test_str = 'geeksforgeeks', K = 'sees' Output : True Explanation : "s" after that "ee" and then "s" is present in order in string 1. Input : test_str = 'geeksforgeeks', K = 'seef' Output : False Explanation :
5 min read
Python - Remove keys with substring values
Sometimes, we need to remove keys whose values contain a specific substring. For example, consider the dictionary d = {'name1': 'hello world', 'name2': 'python code', 'name3': 'world peace'}. If we want to remove keys where the value contains the substring 'world', the resulting dictionary should ex
3 min read
How to Remove a Substring in Python?
In Python, removing a substring from a string can be achieved through various methods such as using replace() function, slicing, or regular expressions. Depending on your specific use case, you may want to remove all instances of a substring or just the first occurrence. Let’s explore different ways
2 min read
Python - Count Strings with substring String List
To count the occurrences of a particular substring in a list of strings in Python, we can use several methods. In this article, we are going to explore different methods to count the existence of a particular substring in a given list. Using sum() and Generator ExpressionThis method uses a generator
3 min read
Word location in String - Python
Word location in String problem in Python involves finding the position of a specific word or substring within a given string. This problem can be approached using various methods in Python, such as using the find(), index() methods or by regular expressions with the re module. Using str.find()str.f
4 min read
Python - Extract string between two substrings
The problem is to extract the portion of a string that lies between two specified substrings. For example, in the string "Hello [World]!", if the substrings are "[" and "]", the goal is to extract "World". If the starting or ending substring is missing, handle the case appropriately (e.g., return an
3 min read
Python - Ways to Count Number of Substring in String
Given a string s, determine the number of substrings that satisfy certain criteria. For example we are given a string s="hellohellohello" we need to count how many time the substring occur in the given string suppose we need to find the substring "hello" so that the count becomes 3. We can use metho
2 min read