Leetcode 2364. Count Number of Bad Pairs
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.