n = int(input())
for i in range(n):
s = input()
print('YES' if ord(max(s)) - ord(min(s)) == len(s)-1 and len(set(s)) == len(s) else 'NO')
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main()
{
bool f=0;
cin>>n;
while (n--){
cin>>s;
sort(s.begin(),s.end());
if(s.size()==1)f=1;
else{
for(int i=0;i<s.size()-1;i++){
if(s[i+1]==s[i]+1) f=1;
else {
f=0;
break;
}
}
}
if(f)cout<<"Yes\n";
else cout<<"No\n";
f=0;
}
return 0;
}1277C - As Simple as One and Two | 1301A - Three Strings |
460A - Vasya and Socks | 1624C - Division by Two and Permutation |
1288A - Deadline | 1617A - Forbidden Subsequence |
914A - Perfect Squares | 873D - Merge Sort |
1251A - Broken Keyboard | 463B - Caisa and Pylons |
584A - Olesya and Rodion | 799A - Carrot Cakes |
1569B - Chess Tournament | 1047B - Cover Points |
1381B - Unmerge | 1256A - Payment Without Change |
908B - New Year and Buggy Bot | 979A - Pizza Pizza Pizza |
731A - Night at the Museum | 742A - Arpa’s hard exam and Mehrdad’s naive cheat |
1492A - Three swimmers | 1360E - Polygon |
1517D - Explorer Space | 1230B - Ania and Minimizing |
1201A - Important Exam | 676A - Nicholas and Permutation |
431A - Black Square | 474B - Worms |
987B - High School Become Human | 1223A - CME |