Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 899 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 899 # by problem number
lcpy gen -s orderly_queue # by problem name
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.
Input: s = "cba", k = 1
Output: "acb"
Explanation: In the first move, we move the 1st character 'c' to the end, obtaining the string "bac".
In the second move, we move the 1st character 'b' to the end, obtaining the final result "acb".
Input: s = "baaca", k = 3
Output: "aaabc"
Explanation: In the first move, we move the 1st character 'b' to the end, obtaining the string "aacab".
In the second move, we move the 3rd character 'c' to the end, obtaining the final result "aaabc".
1 <= k <= s.length <= 1000s consist of lowercase English letters.class Solution:
# Time: O(n^2) for k == 1 (n rotations of length n), O(n log n) for k >= 2
# Space: O(n) for the rotation candidates
def orderly_queue(self, s: str, k: int) -> str:
if k == 1:
return min(s[i:] + s[:i] for i in range(len(s)))
return "".join(sorted(s))
| Time | Space |
|---|---|
| O(n^2) for k == 1 (n rotations of length n), O(n log n) for k >= 2 | O(n) for the rotation candidates |