2026-01-07 15:35:43 +0000 UTC
Orderly Queue
Links
Code
class Solution:
def orderlyQueue(self, s: str, k: int) -> str:
if k > 1:
return "".join(sorted(s))
min_string = s
for i in range(1, len(s)):
min_string = min(min_string, s[i:] + s[:i])
return min_string