← Amazon questions
CodingMedium

Euler's Totient and Inversion Count

Filed under Amazon

Implement Euler's Totient Function (phi(n)) to count integers coprime to n, and count inversions in an array using a modified merge sort.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.