Word Pattern Leetcode -290 || Daily Leetcode Challenge-1st January || Python || Hindi 🔥
Word Pattern Leetcode -290 || Daily Leetcode Challenge-1st January || Python || Hindi 🔥
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.
Example 1:
Input: pattern = "abba", s = "dog cat cat dog"
Output: true
