Wildcard Matching Strings

Lesson 109/115

Loading Lesson...

Data Structures and Algorithms Strings

Wildcard Matching Strings

Lesson 109/115

DATA STRUCTURES • ALGORITHMS
Wildcard Matching StringsDynamic Programming on strings typically involves building a 2D table where DP[i][j] represents the result for prefixes S[0...i] and T[0...j].
Time
O(N * M)
Space
O(N * M)
Key Principle 1
Identify the state (i, j).
Key Principle 2
Define the base cases.
Key Principle 3
Formulate the transition relation.
WILDCARD_MATCHING_STRINGS
abc
Status
Analyzing input parameters...

Loading Lab...

DATA STRUCTURES • ALGORITHMS
Wildcard Matching StringsDynamic Programming on strings typically involves building a 2D table where DP[i][j] represents the result for prefixes S[0...i] and T[0...j].
Time
O(N * M)
Space
O(N * M)
Key Principle 1
Identify the state (i, j).
Key Principle 2
Define the base cases.
Key Principle 3
Formulate the transition relation.
WILDCARD_MATCHING_STRINGS
abc
Status
Analyzing input parameters...