Orderly Queue
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.
Example 1
Input
s = "cba", k = 1Output
"acb"Moving the first character
c to the end gives bac, then moving the first character b to the end gives acb.Example 2
Input
s = "baaca", k = 3Output
"aaabc"Moving
b to the end gives aacab, then moving the third character c to the end gives aaabc.Constraints
- 1 <= k <= s.length <= 1000
- s consist of lowercase English letters.