1import java.util.*;
2public class VowelSpellchecker {
3    public String[] spellchecker(String[] wordlist, String[] queries) {
4        Set<String> exactMatches = new HashSet<>(Arrays.asList(wordlist));
5        Map<String, String> caseSensitiveMatches = new HashMap<>();
6        Map<String, String> vowelInsensitiveMatches = new HashMap<>();
7
8        for (int i = wordlist.length - 1; i >= 0; i--) {
9            String word = wordlist[i];
10            String lower = word.toLowerCase();
11            String vowelMask = maskVowels(lower);
12            caseSensitiveMatches.putIfAbsent(lower, word);
13            vowelInsensitiveMatches.putIfAbsent(vowelMask, word);
14        }
15        
16        String[] result = new String[queries.length];
17
18        for (int i = 0; i < queries.length; i++) {
19            String query = queries[i];
20            if (exactMatches.contains(query)) {
21                result[i] = query;
22            } else {
23                String lowerQuery = query.toLowerCase();
24                String maskedQuery = maskVowels(lowerQuery);
25
26                if (caseSensitiveMatches.containsKey(lowerQuery)) {
27                    result[i] = caseSensitiveMatches.get(lowerQuery);
28                } else if (vowelInsensitiveMatches.containsKey(maskedQuery)) {
29                    result[i] = vowelInsensitiveMatches.get(maskedQuery);
30                } else {
31                    result[i] = "";
32                }
33            }
34        }
35        return result;
36    }
37
38    private String maskVowels(String word) {
39        char[] c = word.toCharArray();
40        for (int i = 0; i < c.length; i++) {
41            if ("aeiou".indexOf(c[i]) >= 0) {
42                c[i] = '*';
43            }
44        }
45        return new String(c);
46    }
47}

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';
    }
};