Word Pattern-LeetCode Python Solution

word_pattern.py

#Method1 :

class Solution:
    def wordPattern(self, pattern: str, str: str) -> bool:
        map_words={}
        map_chars={}
        words=str.split(' ')
        if len(words)!=len(pattern):
            return False
        for c,w in zip(pattern,words):
            if c not in map_chars:
                if w in map_words:
                    return False
                else :
                    map_chars[c]=w
                    map_words[w]=c
            else :
                if map_chars[c]!=w:
                    return False 
        return True 
      
      
 #Method 2:

class Solution:
    def wordPattern(self, pattern: str, str: str) -> bool:
        x=str.split(' ')
        len_char= len(set(pattern))
        len_words=len(set(x))
        return len_char==len_words and len(x)==len(pattern) and len_char==len(set(zip(pattern,x)))