You are given a pattern and a string, s. You need to determine whether the string s follows the same pattern.

A string s is said to follow a pattern if a bijection exists between a character in the pattern and a non-empty word in s.

• Each character in the pattern must map to exactly one unique word in s.

• Each word in s must map to exactly one unique character in pattern.

• No two characters map to the same word, and no two words map to the same character.

Constraints:

• $1 \leq$ pattern.length $\leq 100$

• The pattern contains only lowercase English letters.

• $1 \leq$ s.length $\leq 1000$

• s contains only lowercase English letters and spaces ' '.

• s does not contain any leading or trailing spaces.

• A single space separates all the words in s.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.