Word Pattern
Explore how to determine if a string follows a specific pattern by applying bijection between pattern characters and words in the string. Understand constraints and develop solutions using hash maps to ensure a one-to-one correspondence, gaining skills to solve similar interview questions confidently.
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: