Pattern substring bijection
Given a `pattern` of lowercase letters and a string `s`, return true if there is a bijection between letters in `pattern` and non-empty substrings of `s` such that replacing each pattern letter with its substring yields exactly `s`. The mapping must be one-to-one in both directions (no two letters map to the same substring, and each letter maps to exactly one substring). Both inputs have length 1..20.
Implement
word_pattern_match(pattern: str, s: str) → boolExamples
in
["abab","redblueredblue"]outtrueWhat 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 35 min
solution.py
InputExpectedGot
["abab","redblueredblue"]truenot run yetsample