Code RoomGlob pattern matching
HardPrep Room Coding #1246

Glob pattern matching

CodingAlgorithms & data structuresSenior–Staff~40 min

Implement glob-style wildcard matching. Given an input string `s` and a pattern `p`, where '?' matches any single character and '*' matches any sequence of characters (including empty), return True if the pattern matches the entire string. There are no other special characters. Both strings may be empty.

Implement
glob_match(s: str, p: str) → bool
Examples
in["adceb","*a*b"]outtrue
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 40 min
InputExpectedGot
["adceb","*a*b"]truenot run yetsample