LeetCode – Word Pattern II (Java)

This is the extension problem of Word Pattern I. Given a pattern and a string str, find if str 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 substring in str. Examples: pattern = “abab”, str = “redblueredblue” should return … Read more