Practice Word Pattern
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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. Specifically:
Source: Word Pattern on LeetCode. Use the original task for its coding environment and submissions.
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
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.
Related LeetCode Problems
Practice more problems similar to Word Pattern.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.