FIBE (EARLY SALARY) Hiring Challenge | Off-Campus | OA (2024)

Problem: Count Number of Pairs With Absolute Difference K Given an integer array nums and an integer k, return the number of pairs (i, j) such that: i < j |nums[i] - nums[j]| = k Example Input: nums = [1,2,2,1] k = 1 Output: 4