Given a list of correct words wordlist and a list of queries, implement a spellchecker that attempts to match each query word to a correct word from wordlist.

The spellchecker handles two categories of spelling mistakes:

Capitalization: If the query matches a word in wordlist when compared case insensitively, the query is corrected to the matching word as it appears in wordlist.

Vowel Errors: If, after replacing every vowel ('a', 'e', 'i', 'o', 'u') in the query with any vowel individually, the resulting word matches a word in wordlist (case insensitively), the query is corrected to that matching word. The word lengths must still be equal and consonants must match exactly (case insensitively).

The spellchecker uses the following precedence rules to determine the correct match:

• If the query exactly matches a word in wordlist (case sensitive), return that exact word.

• Otherwise, if the query matches a word in wordlist up to capitalization differences, return the first such match in wordlist.

• Otherwise, if the query matches a word in wordlist up to vowel errors (case insensitive), return the first such match in wordlist.

• If no match is found, return the empty string.

Return a list answer where answer[i] is the corrected word for queries[i].

Note: Vowels are the characters 'a', 'e', 'i', 'o', 'u' (and their uppercase counterparts for case insensitive comparison). All other letters are treated as consonants.

Constraints:

• $1 \leq$ wordlist.length, queries.length $\leq 5000$

• $1 \leq$ wordlist[i].length, queries[i].length $\leq 7$

• wordlist[i] and queries[i] consist only of English letters.

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.