Wildcard Pattern Matching

HardPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Wildcard Pattern Matching. Start with the requirements on the right.

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

You need to log in / sign up to run or submit.

Problem

A Voleon research pipeline uses compact patterns to select text-based instrument labels. Given a string s and a pattern p, determine whether the entire string matches the entire pattern.

The pattern contains lowercase English letters, *, and ?:

A letter matches exactly the same letter.
* matches one or more arbitrary characters.
? matches zero or one arbitrary character.
Matching must cover all characters in both s and p.

Return True if the string matches the pattern, otherwise return False.

Formal Specification

Implement wildcard_match(s, p), where both inputs are strings. Return a Boolean.

Constraints

0 <= len(s) <= 2,000
0 <= len(p) <= 2,000
s and p contain only lowercase English letters, '*' and '?'
A '*' wildcard must match at least one character
Matching is required for the entire string and entire pattern

Function Signature

def wildcard_match(s, p):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output