func_code_string: #include <bits/stdc++.h>   using namespace std;      #define pb push_back   #define ff first   #define ss second   #define lli long long int   #define ll long long   #define st string   #define vi vector<int>   #define vll vector<long long>   #define tll tuple<ll,ll,ll>   #define pii pair<int,int>   #define pll pair<ll,ll>   #define vpii vector<pii>   #define vpll vector<pll>   #define take(n) ll n;cin>>n;   #define takeinp(arr,n) for(long long int i=0;i<n;i++) cin>>arr[i];   #define gcd(a,b) __gcd(a,b)   #define mii map<int,int>   #define mll map<ll,ll>   #define all(x) x.begin(),x.end()   #define allr(x) x.rbegin(),x.rend()   #define mllitr mll::iterator itr;   #define repm(itr,mp) for(itr=mp.begin();itr!=mp.end();itr++)   #define rep(i,a,b) for(ll i=a;i<b;i++)   #define repo(i,a,b) for(ll i=a;i>b;i--)                  //GL HF//      void solve(){       string s;cin>>s;       ll n=s.length()-1;       // cout<<char( a +n)<<  n ;       if(n==0){           if(s[0]!= a ) {cout<< NO n ;return;}       }       while(n>=0){           char tmp =  a +n;           if(s[0]==tmp){               s.erase(s.begin()+0);           }else if(s[n]==tmp){               s.erase(s.begin()+n);           }else{               cout<< NO n ;               return;           }           n--;       }       cout<< YES n ;       // cout<< a +0<<  n ;   }      int main(){       ios_base::sync_with_stdio(false);       cin.tie(NULL);       cout.tie(NULL);       ll t=1;       cin>>t;       while(t--){           solve();       }   }   