string shortestCompletingWord(string licensePlate, vector<string>& words) {
else if(c>='A' && c<='Z')
unordered_map<char,int> temp;
vector<unordered_map<char,int>> wordslist;
unordered_map<char,int> tmp;
wordslist.push_back(tmp);
for(int i=0;i<words.size();i++)
// cout<<c<< " "<<temp[c]<<" "<< wordslist[i][c]<<endl;
if(wordslist[i][c]<temp[c])
if(flag &&words[i].length()<len)