Solution: Word Pattern
Understand how to determine if a string matches a given pattern by implementing a bijection between pattern characters and words. This lesson teaches you to use hash maps to efficiently check consistent mappings, ensuring each character corresponds to a unique word and vice versa.
We'll cover the following...
Statement
You are given a pattern and a string, s. You need to determine whether the string s follows the same pattern.
A string s is said to follow a pattern if a bijection exists between a character in the pattern and a non-empty word in s.
Each character in the
patternmust map to exactly one unique word ins.Each word in
smust map to exactly one unique character inpattern.No two characters map to the same word, and no two words map to the same character.
Constraints:
pattern.length...