_2006.java

package com.fishercoder.solutions;

public class _2006 {
    public static class Solution1 {
        public int countKDifference(int[] nums, int k) {
            int pairs = 0;
            for (int i = 0; i < nums.length - 1; i++) {
                for (int j = i + 1; j < nums.length; j++) {
                    if (Math.abs(nums[i] - nums[j]) == k) {
                        pairs++;
                    }
                }
            }
            return pairs;
        }
    }
}