1def spellChecker(wordlist, queries):
2    def normalize_word(word):
3        return ''.join(['*' if c in 'aeiouAEIOU' else c for c in word])
4    exact_matches = set(wordlist)
5    case_matches = {w.lower(): w for w in reversed(wordlist)}
6    vowel_matches = {}
7    for w in reversed(wordlist):
8        vw = normalize_word(w.lower())
9        if vw not in vowel_matches:
10            vowel_matches[vw] = w
11    def find_match(query):
12        if query in exact_matches:
13            return query
14        low_query = query.lower()
15        if low_query in case_matches:
16            return case_matches[low_query]
17        vow_query = normalize_word(low_query)
18        if vow_query in vowel_matches:
19            return vowel_matches[vow_query]
20        return ""
21    return [find_match(query) for query in queries]

1#include <unordered_map>
2#include <unordered_set>
3#include <vector>
#include <string>
#include <algorithm>
using namespace std;
class Spellchecker {
public:
    vector<string> spellchecker(vector<string>& wordlist, vector<string>& queries) {
        unordered_set<string> exactMatch(wordlist.begin(), wordlist.end());
        unordered_map<string, string> caseInsensitiveMap;
        unordered_map<string, string> vowelInsensitiveMap;

        for (auto it = wordlist.rbegin(); it != wordlist.rend(); ++it) {
            string lowerWord = toLower(*it);
            caseInsensitiveMap[lowerWord] = *it;
            vowelInsensitiveMap[maskVowels(lowerWord)] = *it;
        }

        vector<string> results;
        for (const string& query : queries) {
            if (exactMatch.count(query)) {
                results.push_back(query);
            } else {
                string lowerQuery = toLower(query);
                string vowelMaskedQuery = maskVowels(lowerQuery);
                if (caseInsensitiveMap.count(lowerQuery)) {
                    results.push_back(caseInsensitiveMap[lowerQuery]);
                } else if (vowelInsensitiveMap.count(vowelMaskedQuery)) {
                    results.push_back(vowelInsensitiveMap[vowelMaskedQuery]);
                } else {
                    results.push_back("");
                }
            }
        }
        return results;
    }

private:
    string toLower(const string& word) {
        string res = word;
        transform(res.begin(), res.end(), res.begin(), ::tolower);
        return res;
    }

    string maskVowels(string word) {
        for (char& c : word) {
            if (isVowel(c)) c = '*';
        }
        return word;
    }

    bool isVowel(char c) {
        return c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u';
    }
};