Word Pattern — Python Coding Problem
Difficulty: easy | Category: hash-map
Problem Description
Given a `pattern` and a string `s`, find if `s` follows the same pattern. Here, 'follow' means a full match, such that there is a bijection between a letter in `pattern` and a non-empty word in `s`.
Examples
Example 1
Input: pattern = "abba", s = "dog cat cat dog"
Output: true
Example 2
Input: pattern = "abba", s = "dog cat cat fish"
Output: false
Example 3
Input: pattern = "aaaa", s = "dog cat cat dog"
Output: false