Substring Search Patterns in DSA Python - Execution Trace

Concept Flow - Substring Search Patterns

Start: Text and Pattern

↓

Set index i=0 in Text

↓

Compare Pattern with Text[i..i+len(Pattern)-1

↓

Pattern found at i

→Stop or continue

No↓

Increment i by 1

↓

Check if i <= len(Text) - len(Pattern)

Yes↓

Stop: Pattern not found

↩Back to Compare

The search slides the pattern over the text one by one, comparing characters until a match is found or the text ends.

Execution Sample

DSA Python

text = "hello world"
pattern = "lo"
for i in range(len(text) - len(pattern) + 1):
    if text[i:i+len(pattern)] == pattern:
        print(f"Pattern found at index {i}")
        break

This code searches for the substring 'lo' in 'hello world' by checking each possible position.

Execution Table

Step	Operation	Index i	Substring Compared	Match?	Action	Visual State
1	Compare substring	0	"he"	No	Increment i	Text: h e l l o w o r l d Pattern: l o
2	Compare substring	1	"el"	No	Increment i	Text: h e l l o w o r l d Pattern: l o
3	Compare substring	2	"ll"	No	Increment i	Text: h e l l o w o r l d Pattern: l o
4	Compare substring	3	"lo"	Yes	Print index 3 and stop	Text: h e l l o w o r l d Pattern: l o at index 3
5	Stop	-	-	-	Pattern found, search ends	Final State: Pattern found at index 3

💡 Pattern found at index 3, search stops early.

Variable Tracker

Variable	Step 1	Step 2	Step 3	Step 4	After Step 4	Final
i	0	1	2	3	3	3
Substring Compared	"he"	"el"	"ll"	"lo"	"lo"	"lo"
Match?	No	No	No	Yes	Yes	Yes

Key Moments - 3 Insights

Why do we stop the search when i reaches len(text) - len(pattern) + 1?

Because beyond this point, the remaining text is shorter than the pattern, so no full match is possible. See execution_table row 4 where i=3 and pattern length fits.

Why do we compare text[i:i+len(pattern)] instead of just text[i]?

Because we need to check the entire pattern length at each position, not just one character. Execution_table rows 1-4 show substring comparisons of length equal to the pattern.

What happens if the pattern is not found in the text?

The loop completes without a match and the search ends with no output. This is shown by the exit condition in concept_flow when i exceeds the limit.

Visual Quiz - 3 Questions

Look at the execution_table, what substring is compared at step 3?

A "ll"

B "el"

C "lo"

D "he"

💡 Hint

Check the 'Substring Compared' column at step 3 in execution_table.

At which step does the pattern match the substring?

A Step 2

B Step 4

C Step 3

D Step 5

💡 Hint

Look for 'Match?' column showing 'Yes' in execution_table.

If the pattern was "wo", at which index would the match be found?

A Index 4

B Index 5

C Index 6

D Index 7

💡 Hint

Check the text 'hello world' and find where 'wo' starts.

Concept Snapshot

Substring Search Patterns:
- Slide pattern over text from index 0 to len(text)-len(pattern)
- At each index, compare substring of pattern length
- If match, report index and stop or continue
- Stop when no more full pattern fits
- Simple and direct method for substring search

Full Transcript

Substring search means looking for a smaller string inside a bigger string. We start at the beginning of the big string and check if the smaller string matches the characters starting there. If not, we move one step forward and check again. We keep doing this until we find the smaller string or reach the end where the smaller string cannot fit anymore. This method compares substrings of the same length as the pattern at each step. When a match is found, we can stop or continue searching. If no match is found, the search ends after checking all possible positions.