Solution Paris Hackerank by conaldev

 static int pairs(int k, int[] arr) {
        Arrays.sort(arr);
        int countPairs =0;
        for(int i=0;i<arr.length-1;i++){
            for(int j=i+1;j<arr.length;j++){
                int diff = arr[j] - arr[i];
                if(diff>k)
                    break;
                else if(diff ==k)
                    countPairs++;
            }
        }
        return countPairs++;
    }