You are given two string arrays, queries and dictionary, where all strings in both arrays have the same length.

In one edit, you can choose any character of a word and replace it with any other lowercase English letter.

Return a list of all strings in queries that can be transformed to match at least one word in dictionary using at most $2$ edits. The output list should preserve the original relative order of the words in queries.

Constraints:

• $1 \leq$ queries.length, dictionary.length $\leq 100$

• n $==$ queries[i].length $==$ dictionary[j].length

• $1 \leq$ n $\leq 100$

• All queries[i] and dictionary[j] consist of lowercase English letters.

Input: queries = ["cat","bat","zzz","hat"]-List[str], dictionary = ["cap","map"]-List[str]
Output: ["cat","bat","hat"]-List[str]
Explanation: “cat” is one edit from “cap”, “bat” is two edits from “map”, and “hat” is two edits from “cap”. “zzz” requires more than two edits from every dictionary word, so it is excluded.

Input: queries = ["apple","apply","ample","grape"]-List[str], dictionary = ["apple","apron"]-List[str]
Output: ["apple","apply","ample"]-List[str]
Explanation: “apple” matches directly, while “apply” and “ample” are each one edit from “apple”. “grape” is more than two edits from every dictionary word, so it is excluded.

Input: queries = ["aaaa","bbbb","cccc"]-List[str], dictionary = ["dddd","eeee"]-List[str]
Output: []-List[str]
Explanation: Each query differs from every dictionary word in more than two positions, so no queries qualify.

Input: queries = ["house","mouse","horse","plant"]-List[str], dictionary = ["mouse","shore","grant"]-List[str]
Output: ["house","mouse","horse","plant"]-List[str]
Explanation: “house” is one edit from “mouse”, “mouse” matches directly, “horse” is two edits from “mouse”, and “plant” is two edits from “grant”. Therefore, all queries qualify.

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.