Wildcard Matching LeetCode | Dataford Interview Questions

A Voleon research pipeline uses compact wildcard patterns to classify signal labels. Given a label s and a pattern p, determine whether the entire label matches the entire pattern.

The pattern supports two special characters:

? matches exactly one character.
* matches any sequence of characters, including an empty sequence.

All other characters match themselves. Return True only when every character in s is matched by the complete pattern p.

Formal Specification

Implement is_match(s, p), where s and p are strings, and return a boolean. The inputs contain lowercase English letters, ?, and *. A wildcard may match characters but cannot match only part of a literal character.

Constraints

0 <= len(s), len(p) <= 2 * 10^5
Inputs contain only lowercase English letters, '?' and '*'.
Matching is case-sensitive.
The entire label and pattern must match.

Function Signature

def is_match(s, p):

Your question is Wildcard Matching LeetCode. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem