Amazon Delivery Route Count Inversions
Amazon Delivery Route Count Inversions
MediumSorting0% accepted
Amazon measures route inefficiency as inversions: pairs (i,j) where i<j but arr[i]>arr[j]. Count total inversions using merge sort in O(n log n).
Approach
Count inversions in array using merge sort (during merge step count cross-inversions).
Input
5
1 20 6 4 5
Output
5
More Sorting problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards