Count Pairs of Numbers with a Given Difference K

Question

Hi Experts Given an unsorted array and a number n find if there exists a pair of elements in the array whose difference is n. Return count of such pairs. Example k=4 and a[]={76231910119315} Output should be : 6 Pairs can be: 711(11-7=4) 73(7-3=4) 610(10-6=4) 1923(23-19=4) 1519(19-15=4) 1511(15-11=4) Please Help me. Thanks & Regards Ashish Kumar Sahu

Ashish Sahu · Answer

class ArraryDistinctPairs { static int countPairsWithDiffK(int[] arr int n int k) { int count = 0; for (int i = 0; i { for (int j = i + 1; j if (arr[i] - arr[j] == k || arr[j] - arr[i] == k) count++; } return count; } static void Main() { int[] arr = { 7 6 23 19 10 11 9 3 15 }; int n = arr.Length; int k = 4; Console.WriteLine(Count of pairs with given diff is  + countPairsWithDiffK(arr n k)); Console.ReadLine(); } }