D. J.:

- Added the leetcode problem and solution for 290 Word Pattern

Author: nobodyPerfecZ

README.md

@@ -16,6 +16,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [169 Majority Element](https://leetcode.com/problems/majority-element/description/)
 - [189 Rotate Array](https://leetcode.com/problems/rotate-array/description/)
 - [205 Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/description/)
+- [290 Word Pattern](https://leetcode.com/problems/word-pattern/description/)
 - [383 Ransom Note](https://leetcode.com/problems/ransom-note/description/)
 - [392 Is Subsequence](https://leetcode.com/problems/is-subsequence/description/)
 

awesome_python_leetcode/_290_word_pattern.py

@@ -0,0 +1,23 @@
+class Solution:
+    def wordPattern(self, pattern: str, s: str) -> bool:
+        """
+        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:
+        - Each letter in pattern maps to exactly one unique word in s.
+        - Each unique word in s maps to exactly one letter in pattern.
+        - No two letters map to the same word, and no two words map to the same letter.
+        """
+        s = s.split()
+        if len(pattern) != len(s):
+            return False
+        policy, reverse_policy = {}, {}
+        for pattern_, s_ in zip(pattern, s):
+            if pattern_ in policy and policy[pattern_] != s_:
+                return False
+            if s_ in reverse_policy and reverse_policy[s_] != pattern_:
+                return False
+            policy[pattern_] = s_
+            reverse_policy[s_] = pattern_
+        return True

tests/test_290_word_pattern.py

@@ -0,0 +1,16 @@
+import pytest
+
+from awesome_python_leetcode._290_word_pattern import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["pattern", "s", "expected"],
+    argvalues=[
+        ("abba", "dog cat cat dog", True),
+        ("abba", "dog cat cat fish", False),
+        ("aaaa", "dog cat cat dog", False),
+    ],
+)
+def test_func(pattern: str, s: str, expected: bool):
+    word_pattern = Solution().wordPattern(pattern, s)
+    assert word_pattern == expected