You are given a binary string (consisting of 0,1) and you can rotate the string in any order. Basically if the string is s1s2s3...s(n-1)s(n) , you can make it s2s3s4,,,s(n-1)s(n)s1 .
Print out the rotation which has the maximum value in binary representation.
|s| <= 10^5
Can anyone suggest any approach ? I'm unable to think of any fast approach.