Available question text
Given string s and pattern p containing exactly one '*' that can match any (possibly empty) sequence, determine whether p can be turned into a substring of s by replacing '*' appropriately. Effectively, check if s contains a contiguous segment whose prefix and suffix match the parts of p before and after the '*' (with any middle content allowed).
Related questions
Continue with questions that share topics or the same question type.
- Repeated Substring Pattern
Coding
- Shortest Matching Substring
Coding
- String Matching in an Array (Substring Containment)
Coding
- 132 Pattern
Coding · Array · Binary Search · Monotonic Stack
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3407. Substring Matching Pattern
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source