##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Variant of inversion counting
Given an integer array nums, count the number of reverse pairs: indices where and . Example: nums returns .
Reverse pairs: since , and since .
This is similar to inversions, but the condition is instead of . Approach: process right to left, query for elements less than . Constraints: up to elements, values up to .
