Available question text
Count how many index pairs (i, j) satisfy j - i != nums[j] - nums[i]; equivalently, good pairs have equal values of nums[k] - k, so the task reduces to grouping indices by nums[i]-i and subtracting the number of equal-value pairs from total pairs (n*(n-1)/2).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
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 2364. Count Number of Bad Pairs
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source