Leetcode Problem 290. Word Pattern

290. Word Pattern

Leetcode Solutions

Split s into words based on spaces.
If the number of words does not match the length of pattern, return False.
Initialize two empty hash maps: char_to_word and word_to_char.
Iterate over the characters in pattern and the corresponding words in s. a. If the character is not in char_to_word, check if the word is in word_to_char. If it is, return False. b. If the character is in char_to_word, check if it maps to a different word. If it does, return False. c. Update char_to_word and word_to_char with the new character-word pair.
If all character-word pairs are processed without conflicts, return True.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen