Given a list of strings words and a string pattern, return a list of all strings in words that match pattern. You may return the answer in any order.

A word matches the pattern if there exists a bijection between the letters in pattern and the letters in the word such that replacing every character in pattern with its mapped character produces the word. That is, every letter in pattern maps to a unique letter, and no two distinct letters in pattern map to the same letter.

Constraints:

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

• $1 \leq$ words.length $\leq 50$

• words[i].length $=$ pattern.length

• pattern and words[i] consist only of lowercase English letters.

Now, 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.