Multiple Methods for Substring Existence Checking in Python and Performance Analysis

Using the in Operator for Substring Checking

In Python, checking if a string is a subset of another string can be achieved using the simple in operator. This method is concise and efficient, making it the most commonly used approach in daily programming.

substring = "please help me out"
string = "please help me out so that I could solve this"
result = substring in string
print(result)  # Output: True

The in operator returns a boolean value: True if the substring exists in the target string, otherwise False. The time complexity of this method is typically O(n), where n is the length of the target string.

Custom Substring Search Function

To gain deeper understanding of substring search principles, we can implement a custom function based on nested loops. Although less efficient, this approach helps in understanding the underlying algorithm logic.

def find_substring(txt, pat):
    n = len(txt)
    m = len(pat)
    
    # Iterate through all possible starting positions in target string
    for i in range(n - m + 1):
        # Check if substring starting from current position matches
        j = 0
        while j < m and txt[i + j] == pat[j]:
            j += 1
        
        # If pattern string is completely matched
        if j == m:
            return i  # Return starting index
    
    return -1  # Return -1 if not found

# Usage example
txt = "geeksforgeeks"
pat = "eks"
index = find_substring(txt, pat)
print(f"Substring starting index: {index}")  # Output: Substring starting index: 2

This method has a time complexity of O(m*n), where m is the pattern string length and n is the target string length. In the worst case, it requires complete pattern matching checks for every possible starting position.

Using Built-in find() Method

Python provides the built-in find() method, which can more efficiently locate substrings and return their starting indices.

txt = "geeksforgeeks"
pat = "eks"
index = txt.find(pat)

if index != -1:
    print(f"Substring found at index {index}")
else:
    print("Substring not found")

The find() method typically has better time complexity than custom nested loop implementations, as it may use more optimized algorithms. If only existence checking is needed without concern for position, using the in operator is more concise.

Performance Comparison and Selection Recommendations

Different substring checking methods are suitable for different scenarios:

• in operator: Ideal for quick existence checks, with concise code and good performance
• find() method: Best choice when substring position information is needed
• Custom implementation