Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Block Placement Queries
Coding · Array · Binary Indexed Tree · Binary Search
- 132 Pattern
Coding · Array · Binary Search · Monotonic Stack
- Median of Two Sorted Arrays
Coding · Array · Binary Search · Divide and Conquer
- Number of Flowers in Full Bloom
Coding · Array · Binary Search · Hash Table
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 493. Reverse Pairs
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
eBay
Reverse Pairs
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 81. This is not an interview probability.
View source