Word Pattern Problem

Word Pattern Problem — ExecCode Easy DSA Practice

Solve the Word Pattern problem on ExecCode. Free online easy DSA practice in Hashing. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given a pattern and a string s, find if s follows the same pattern. Your task is to here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s. Specifically: - Each letter in pattern maps to exactly one unique word in s. - Each unique word in s maps to exactly one letter in pattern. Return the required answer exactly as shown in the examples.

Examples

Input pattern = "abba", s = "dog cat cat dog"; Output true. Input pattern = "abba", s = "dog cat cat fish"; Output false. Input pattern = "aaaa", s = "dog cat cat dog"; Output false

Constraints

1 <= pattern.length <= 300 pattern contains only lower-case English letters. 1 <= s.length <= 3000 s contains only lowercase English letters and spaces ' '. s does not contain any leading or trailing spaces. All the words in s are separated by a single space.

Practice Word Pattern free on ExecCode. Browse DSA problems, topic map, and placement guides.