Problem Statement
Count reverse pairs in array.
Approach
Modified merge sort. Count pairs before merging.
Time & Space Complexity
Time O(n log n), Space O(n).

The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview
Count pairs where arr[i] > 2×arr[j].
Count reverse pairs in array.
Modified merge sort. Count pairs before merging.
Time O(n log n), Space O(n).
Loading Interactive Visualizer...
Click "Play" or use arrow keys to step through the execution.