Count Inversions
An inversion is a pair of nodes where the earlier node has a strictly larger value than the later node. Return the number of inversions in the list. A sorted list has 0. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [3,1,2]
returns 2
The pairs (3,1) and (3,2).
Example 2
head [2,2,2]
returns 0
Equal values are not inversions.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.