func_code_string: #include <bits/stdc++.h>   void mergesort(char z[], int left, int right) {     char temp[1000];     if (left >= right) {       return;     }     int mid = (left + right) / 2;     mergesort(z, left, mid);     mergesort(z, mid + 1, right);     int lenl = mid;     int lenr = right;     int i = left, j = mid + 1, k = left;     while (i <= lenl && j <= lenr) {       if (z[i] >= z[j]) {         temp[k] = z[i];         k++;         i++;       } else {         temp[k] = z[j];         k++;         j++;       }     }     while (i <= lenl) {       temp[k] = z[i];       k++;       i++;     }     while (j <= lenr) {       temp[k] = z[j];       k++;       j++;     }     for (int i = left; i <= right; i++) {       z[i] = temp[i];     }   }   int main() {     int a, b, c, d, e, f, g, h;     char z[1000];     scanf( %d , &a);     getchar();     for (int i = 0; i < a; i++) {       scanf( %s , z);       getchar();       b = strlen(z);       mergesort(z, 0, b - 1);       if (b == 1) {         printf( YES n );       } else {         for (int j = 0; j < b - 1; j++) {           if ((z[j] - z[j + 1]) == 1) {           } else {             printf( NO n );             break;           }           if (j == b - 2) {             printf( YES n );           }         }       }     }     return 0;   }   