Time: 11 ms (97.09%), Space: 13.8 MB (5.64%) - LeetHub

290-word-pattern/290-word-pattern.py

@@ -0,0 +1,29 @@
+class Solution(object):
+    def wordPattern(self, pattern, s):
+        """
+        :type pattern: str
+        :type s: str
+        :rtype: bool
+        """
+        words = s.split()
+        letterToWord = {}
+        
+        # Lengths do not match
+        if len(words) != len(pattern):
+            return False
+        
+        for i in range(len(pattern)):
+            # First iteration of a letter in pattern
+            if pattern[i] not in letterToWord:
+                # Word cannot be represented by multiple letters
+                if words[i] in letterToWord.values():
+                    return False
+                
+                letterToWord[pattern[i]] = words[i]
+                continue
+            
+            # Does word match pattern
+            if letterToWord[pattern[i]] != words[i]:
+                return False
+            
+        return True