Search⌘ K
AI Features

Solution: Word Pattern

Understand how to determine if a string follows a given pattern by creating a one-to-one mapping between pattern characters and words. This lesson teaches you to use hash maps to efficiently verify pattern consistency with linear time complexity.

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 ...