Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Lexicographically Smallest Rotation > Editorial

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|2) brute force fits; O(|S|) with Booth's algorithm