Lexicographically Smallest Rotation — Solution & Editorial

Back to the Problem

With |S| ≤ 2000, generating all rotations (using S+S slices) and taking the minimum is fast enough; Booth's algorithm does it in O(|S|) if you want elegance.

Complexity: O(|S|²) brute force fits; O(|S|) with Booth's algorithm