<p>Given a <code>wordlist</code>, we want to implement a spellchecker that converts a query word into a correct word.</p>

<p>For a given <code>query</code> word, the spell checker handles two categories of spelling mistakes:</p>

<ul>
	<li>Capitalization: If the query matches a word in the wordlist (<strong>case-insensitive</strong>), then the query word is returned with the same case as the case in the wordlist.

	<ul>
		<li>Example: <code>wordlist = [&quot;yellow&quot;]</code>, <code>query = &quot;YellOw&quot;</code>: <code>correct = &quot;yellow&quot;</code></li>
		<li>Example: <code>wordlist = [&quot;Yellow&quot;]</code>, <code>query = &quot;yellow&quot;</code>: <code>correct = &quot;Yellow&quot;</code></li>
		<li>Example: <code>wordlist = [&quot;yellow&quot;]</code>, <code>query = &quot;yellow&quot;</code>: <code>correct = &quot;yellow&quot;</code></li>
	</ul>
	</li>
	<li>Vowel Errors: If after replacing the vowels <code>(&#39;a&#39;, &#39;e&#39;, &#39;i&#39;, &#39;o&#39;, &#39;u&#39;)</code> of the query word with any vowel individually, it matches a word in the wordlist (<strong>case-insensitive</strong>), then the query word is returned with the same case as the match in the wordlist.
	<ul>
		<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yollow&quot;</code>: <code>correct = &quot;YellOw&quot;</code></li>
		<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yeellow&quot;</code>: <code>correct = &quot;&quot;</code> (no match)</li>
		<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yllw&quot;</code>: <code>correct = &quot;&quot;</code> (no match)</li>
	</ul>
	</li>
</ul>

<p>In addition, the spell checker operates under the following precedence rules:</p>

<ul>
	<li>When the query exactly matches a word in the wordlist (<strong>case-sensitive</strong>), you should return the same word back.</li>
	<li>When the query matches a word up to capitlization, you should return the first such match in the wordlist.</li>
	<li>When the query matches a word up to vowel errors, you should return the first such match in the wordlist.</li>
	<li>If the query has no matches in the wordlist, you should return the empty string.</li>
</ul>

<p>Given some <code>queries</code>, return a list of words <code>answer</code>, where <code>answer[i]</code> is the correct word for <code>query = queries[i]</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> wordlist = ["KiTe","kite","hare","Hare"], queries = ["kite","Kite","KiTe","Hare","HARE","Hear","hear","keti","keet","keto"]
<strong>Output:</strong> ["kite","KiTe","KiTe","Hare","hare","","","KiTe","","KiTe"]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> wordlist = ["yellow"], queries = ["YellOw"]
<strong>Output:</strong> ["yellow"]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= wordlist.length, queries.length &lt;= 5000</code></li>
	<li><code>1 &lt;= wordlist[i].length, queries[i].length &lt;= 7</code></li>
	<li><code>wordlist[i]</code> and <code>queries[i]</code> consist only of only English letters.</li>
</ul>

class Solution {
public:
    string decap(string& wordlist){
        string u=wordlist;
        for(int i=0;i<u.size();i++){
            if(u[i]>='A' && u[i]<='Z'){
                u[i]=u[i]-'A'+'a';
            }
        }
        return u;

    }
    bool isvow(char c){
        return c=='a' || c=='e' || c=='i' || c=='o' || c=='u';
    }
    int dp1(int i,string& s,unordered_map<string,int>&mp){
        // cout<<i<<" "<<s<<endl;
        if(i==s.size()){
            if(mp.find(s)!=mp.end()){
                return mp[s];
            }
            return -1;
        }
        char t[5]={'a','e','i','o','u'};
        char c=s[i];
        int min1=INT_MAX;
        if(isvow(s[i])){
            for(int j=0;j<5;j++){
                s[i]=t[j];
                int u=dp1(i+1,s,mp);
                if(u>=0){
                    min1=min(min1,u);
                }
                s[i]=c;
            }
        }
        else{
            int u=dp1(i+1,s,mp);
            if(u>=0){
                min1=min(min1,u);
            }
        }
        return min1==INT_MAX?-1:min1;
    }
    vector<string> spellchecker(vector<string>& wordlist, vector<string>& queries) {
        unordered_map<string,int>mp;
        unordered_set<string>mp1;
        for(int i=0;i<wordlist.size();i++){
            mp1.insert(wordlist[i]);
            string u=wordlist[i];
            for(int i=0;i<u.size();i++){
                if(u[i]>='A' && u[i]<='Z'){
                    u[i]=u[i]-'A'+'a';
                }
            }
            if(mp.find(u)==mp.end()){
                mp[u]=i;
            }
        }
        // for(auto x:mp){
        //     cout<<x.first<<" "<<x.second<<endl;
        // }
        vector<string>ans;
        for(int i=0;i<queries.size();i++){
            auto y=queries[i];
            auto y1=decap(y);
            // cout<<y<<" "<<y1<<" ";
            if(mp1.find(y)!=mp1.end()){
                ans.push_back(y);
            }
            else if(mp.find(y1)!=mp.end()){
                ans.push_back(wordlist[mp[y1]]);
            }
            else{
                int u1=dp1(0,y1,mp);
                // cout<<i<<" "<<u1<<endl;
                if(u1==-1){
                    ans.push_back("");
                }
                else{
                    ans.push_back(wordlist[u1]);
                }
            }
        }
        return ans;

        
    }
};
36200