Orderly Queue
Find the smallest string reachable by repeatedly moving one of the first k letters to the back. The visual compares rotations when k is at least two and sorts the letters when k is one.
Find the smallest string reachable by repeatedly moving one of the first k letters to the back. The visual compares rotations when k is at least two and sorts the letters when k is one.