Given a string S consisting of lowercase alphabets. The task is to find the lexicographically smallest string X of the same length only that can be formed using the operation given below:
In a single operation, select any one character among the at most first K characters of string S, remove it from string S and append it to string X. Apply this operation as many times as he wants.
Input: str = “gaurang”, k=3
Remove ‘a’ in the first step and append to X.
Remove ‘g’ in the second step and append to X.
Remove ‘a’ in the third step and append to X.
Remove ‘n’ in the third step and append to X.
Pick the lexicographically smallest character at every step from the first K characters to get the
Input: str = “geeksforgeeks”, k=5
- Find the smallest character in the first k characters in the string S.
- Delete the smallest character found from the string.
- Append the smallest character found to the new string X.
- Repeat the above steps till the string s is empty.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Lexicographically largest string possible for a given cost of appending characters
- Lexicographically smallest string formed by removing at most one character
- Minimal moves to form a string by adding characters or appending string itself
- Lexicographically smallest string formed by removing duplicates
- Lexicographically smallest subsequence possible by removing a character from given string
- Lexicographically largest string formed from the characters in range L and R
- Find a string such that every character is lexicographically greater than its immediate next character
- Find the lexicographically smallest sequence which can be formed by re-arranging elements of second array
- Lexicographically smallest array formed by at most one swap for every pair of adjacent indices
- Make the string lexicographically smallest and non palindromic by replacing exactly one character
- Print the last character of lexicographically smallest non-palindromic permutation of a string
- Swap all occurrences of two characters to get lexicographically smallest string
- Make the string lexicographically smallest and non palindromic by swapping of adjacent pair of characters
- Count of times second string can be formed from the characters of first string
- Check whether second string can be formed from characters of first string
- Make lexicographically smallest palindrome by substituting missing characters
- Check if a string can be obtained by appending subsequences of another string
- Check if string S2 can be obtained by appending subsequences of string S1
- Strings formed from given characters without any consecutive repeating characters
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.