Lexicographically Smallest String After Substring Operation

Lexicographically Smallest String After Substring Operation - Problem

String Greedy Medium

Given a string s consisting of lowercase English letters. You must perform exactly one operation:

Operation: Select any non-empty substring and replace every letter of the substring with the preceding letter of the English alphabet. For example, 'b' is converted to 'a', and 'a' is converted to 'z'.

Return the lexicographically smallest string after performing the operation.

Input & Output

Example 1 — Non-'a' Character

$ Input: s = "cba"

› Output: "bba"

💡 Note: We can select the substring "c" and change it to "b". The resulting string "bba" is lexicographically smallest possible.

Example 2 — All 'a' Characters

$ Input: s = "aaa"

› Output: "aaz"

💡 Note: Since all characters are 'a', we must change at least one. Changing the last 'a' to 'z' gives us "aaz", which is lexicographically smallest.

Example 3 — Mixed Characters

$ Input: s = "abcxyz"

› Output: "aacxyz"

💡 Note: The first non-'a' character is 'b' at position 1. Changing 'b' to 'a' gives "aacxyz".

Constraints

1 ≤ s.length ≤ 10⁵
s consists of lowercase English letters only

Visualization

Tap to expand

Asked in

G Google 25 M Microsoft 18

The key insight is that to get the lexicographically smallest string, we should change the leftmost character that can be made smaller. The greedy approach finds the first non-'a' character and decrements it, or changes the last 'a' to 'z' if all characters are 'a'. Time: O(n), Space: O(n)

Common Approaches

✓ Brute Force - Try All Substrings

⏱️ Time: O(n³) Space: O(n²)

Generate all possible substrings, apply the operation to each, and compare results to find the lexicographically smallest string.

Greedy - Optimal Single Pass

⏱️ Time: O(n) Space: O(n)

To get lexicographically smallest result, we should change the leftmost position that makes the string smaller. If we find a non-'a' character, decrement it. If all characters are 'a', change the last one to 'z'.

Brute Force - Try All Substrings — Algorithm Steps

Step 1: Generate all possible non-empty substrings
Step 2: For each substring, create a new string with operation applied
Step 3: Compare all results and return the lexicographically smallest

Visualization

Tap to expand

Step-by-Step Walkthrough

Generate Substrings

Try all O(n²) possible substrings

Apply Operation

Transform each character in substring

Compare Results

Find lexicographically smallest

Code -

solution.c — C

#include <stdio.h>
#include <string.h>

int main() {
    char s[100];
    fgets(s, sizeof(s), stdin);
    s[strcspn(s, "\n")] = 0;
    
    int n = strlen(s);
    
    // Find the first non-'a' character
    for (int i = 0; i < n; i++) {
        if (s[i] != 'a') {
            s[i] = s[i] - 1;
            printf("%s\n", s);
            return 0;
        }
    }
    
    // If all characters are 'a', change the last one to 'z'
    s[n - 1] = 'z';
    printf("%s\n", s);
    return 0;
}

Time & Space Complexity

Time Complexity

⏱️

O(n³)

O(n²) substrings × O(n) string creation and comparison

✓ Linear Growth

Space Complexity

O(n²)

Storing O(n²) different result strings for comparison

⚡ Linearithmic Space

23.5K Views

Medium Frequency

~15 min Avg. Time

890 Likes

Ln 1, Col 1

Smart Actions

💡 Explanation

AI Ready

💡 Suggestion Tab to accept Esc to dismiss

// Output will appear here after running code

Code Editor Closed

Click the red button to reopen

Input & Output

Constraints

Visualization

Related Problems

Common Approaches

Brute Force - Try All Substrings — Algorithm Steps

Visualization

Code -

Time & Space Complexity

Select Compiler