Rotations

s=input()
a=s+s
n=len(a)
f=[-1]*n
k=0
for j in range(1,n):
    o=a[j]
    i=f[j-k-1]
    while (i!=-1 and o!=a[k+i+1]):
        if o<a[k+i+1]:
            k=j-i-1
        i=f[i]
    if o!=a[k+i+1]:
        if (o<a[k]):
            k=j
        f[j-k]= -1
    else:
        f[j-k]=i+1
print(s[k:]+s[:k])

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED