Practice Orderly Queue
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string. Return the lexicographically smallest string you could have after applying the mentioned step any number of moves.
Source: Orderly Queue on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
s = "cba", k = 1
Output
"acb"
# Example 2
Input
s = "baaca", k = 3
Output
"aaabc"
Constraints
1 <= k <= s.length <= 1000
s consist of lowercase English letters.
Related LeetCode Problems
Practice more problems similar to Orderly Queue.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.