Skip to content

Practice Count Number of Pairs With Absolute Difference K

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#2006
LeetCode Problem

Count Number of Pairs With Absolute Difference K

Problem Statement

Given an integer array nums and an integer k, return the number of pairs (i, j) where i < j such that |nums[i] - nums[j]| == k. The value of |x| is defined as:

Source: Count Number of Pairs With Absolute Difference K on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,2,2,1], k = 1
Output
4

# Example 2

Input
nums = [1,3], k = 3
Output
0

# Example 3

Input
nums = [3,2,1,5,4], k = 2
Output
3

Constraints

1 <= nums.length <= 200
1 <= nums[i] <= 100
1 <= k <= 99

Related LeetCode Problems

Practice more problems similar to Count Number of Pairs With Absolute Difference K.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.