Practice Count Number of Bad Pairs
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given a 0-indexed integer array nums. A pair of indices (i, j) is a bad pair if i < j and j - i != nums[j] - nums[i]. Return the total number of bad pairs in nums.
Source: Count Number of Bad Pairs on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [4,1,3,3]
Output
5
# Example 2
Input
nums = [1,2,3,4,5]
Output
0
Constraints
1 <= nums.length <= 10^5
1 <= nums[i] <= 10^9
Related LeetCode Problems
Practice more problems similar to Count Number of Bad Pairs.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.