Is Greater Hackerrank Solution C: Bigger
// Step 1: Find the pivot for (i = n - 2; i >= 0; i--) if (str[i] < str[i + 1]) break;
if (i < 0) printf("no answer\n"); return; bigger is greater hackerrank solution c
printf("%s\n", str);
// Step 1: Find the pivot for (i = n - 2; i >= 0; i--) if (str[i] < str[i + 1]) break;
if (i < 0) printf("no answer\n"); return; bigger is greater hackerrank solution c
printf("%s\n", str);