<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:
    int getdiff(string& word, string& query)
    {
        int diff = 0;
        for(int i=0; i<word.length(); i++)
        {
            if(word[i]!=query[i])
            {
                if(tolower(word[i])==tolower(query[i]))
                {
                    diff+=1;
                }
                else
                    diff+=100;
            }
        }
        return diff;
        
    }
    string getcode(string& word)
    {
        string s = word;
            for(int j=0; j<s.length(); j++)
            {
                s[j] = tolower(s[j]);
                switch(s[j])
                {
                    case 'a':
                    case 'e':
                    case 'i':
                    case 'o':
                    case 'u': s[j] = '*';
                }
                
            }
        return s;
    }
    vector<string> spellchecker(vector<string>& wordlist, vector<string>& queries) {
        unordered_map<string, vector<int>> m;
        for(int i=0; i<wordlist.size(); i++)
        {
            string s = getcode(wordlist[i]);
            if(m.find(s)==m.end())
                m[s] = vector<int> (0);
            m[s].push_back(i);
        }
        vector<string> ans(queries.size(), "");
        for(int i=0; i<queries.size(); i++)
        {
            string s = getcode(queries[i]);
            
			if(m.find(s)!=m.end())
            {
               
			   int one=-1, two = -1, three = -1;
			   
			   //case one: exact match
			   //case two: capitlization
			   //case three: vowel errors
                for(int j=0; j<m[s].size(); j++)
                {
                    int diff = getdiff(wordlist[m[s][j]], queries[i]);
                    if(diff==0)
                    {
                        one = j;
                        break;
                    }
                    else if(two==-1&&diff<100)
                    {
                        two = j;
                    }
                    else if(three==-1&&diff>=100)
                    {
                        three = j;
                    }
					
                }
                
                if(one!=-1)
                    ans[i] = wordlist[m[s][one]];
                else if(two!=-1)
                    ans[i]= wordlist[m[s][two]];
                else
                    ans[i]= wordlist[m[s][three]];
               
            }
        }
        
        return ans;
    }
};
32900