CodingHardcod-g521

Subject Dynamic programming 2dLevel Senior–Staff~30 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Implement wildcard pattern matching over the whole string s with pattern p, where '?' matches any single character and '*' matches any sequence of characters including the empty sequence. Return whether p matches s entirely. Both strings may be empty and contain only lowercase letters plus the wildcards.

Implement

wildcard_match(s: str, p: str) → bool

Examples

in["aa","a"]outfalse

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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.