Search⌘ K
AI Features

Solution: Word Pattern

Explore how to determine if a string matches a specific pattern using hash maps in C#. This lesson teaches you to check one-to-one mappings between pattern characters and words, helping you understand bijections and implement efficient solutions in coding interviews.

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 pattern must map to exactly one unique word in s.

  • Each word in s must map to exactly one unique character in pattern.

  • No two characters map to the same word, and no two words map to the same character.

Constraints:

  • 11 \leq pattern.length 100\leq 100 ...