Leetcode 493. Reverse Pairs

Count the number of index pairs (i, j) with 0 ≤ i < j < n such that nums[i] > 2 * nums[j]; this is an inversion-count variant that requires better than O(n²) time and is typically solved with divide-and-conquer (merge-sort counting) or an ordered data structure to achieve O(n log n).