Bigger Is Greater Hackerrank Solution: C
// Step 1: Find the pivot for (i = n - 2; i >= 0; i--) if (str[i] < str[i + 1]) break;
// Step 3: Swap pivot with that character swap(&str[i], &str[j]); bigger is greater hackerrank solution c
// Step 4: Reverse the suffix after pivot reverse(str, i + 1, n - 1); // Step 1: Find the pivot for (i
while (t--) char str[101]; scanf("%s", str); biggerIsGreater(str); i--) if (str[i] <
printf("%s\n", str);