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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2364. Count Number of Bad Pairs

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact