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 > Counting Necklaces > Editorial

Counting Necklaces — Solution & Editorial

Back to the Problem

Burnside's lemma over the rotation group: the answer is (1/N) ∑d|N φ(N/d) Kd. Enumerate divisors in O(√N), compute totients, and divide by N with a modular inverse.

Complexity: O(√N · (log + √))

Watch out: Dividing by N under the modulus needs an inverse (N is coprime to the prime modulus).