Same problem, But in my case this is Test case 2.

I just modified n to arr_temp.size() and it accepted.

Yup. Sample Test #2 when you "Run", Test #5 when you submit. It should be corrected but here is an easy Java workaround:

    int n = scanner.nextInt();

    int[] arr = new int[n];

    int i = 0; 
    try{
        for (; i < n; i++) {
            arr[i] = scanner.nextInt();
        }
    } catch(NoSuchElementException ex){
        arr = Arrays.copyOf(arr, i);
    }

Yup Same.

yes ,testcase 5 seems to ignored by the author.

It causes segmentation fault in c++ stub

@HackerRank should review this!!!

PHP solution

sort($arr);
$minDiff=$arr[1]-$arr[0];
$res=[];

for ($i=0; $i < $n-1; $i++) { 
	if($arr[$i+1]-$arr[$i] < $minDiff ){
		$res=[];
		$res[]=$arr[$i];
		$res[]=$arr[$i+1];
		$minDiff=abs($arr[$i+1]-$arr[$i]);
	}elseif($arr[$i+1]-$arr[$i] == $minDiff ){
		$res[]=$arr[$i];
		$res[]=$arr[$i+1];
	}
}
for ($i=0; $i < count($res); $i++) { 
	echo $res[$i].' ';
}

C++:

int n;
cin >> n;
int a[n];
for (int i=0;i<n;i++) cin >> a[i];

sort(a,a+n);
int diff[n];
adjacent_difference(a,a+n,diff);
int min=*min_element(diff+1,diff+n);

for (int i=1;i<n;i++) {
    if (diff[i]==min) cout << a[i-1] << " " << a[i] << " ";
}

when you have already sorted, you dont need to take the absolute value, just saying

    lowestDiff = abs(nums[i+1]-nums[i])

I did this in two pass, once to find the min diff, and one more to add the pairs if diff is min diff. It's because I thought it's wasteful to keep adding the pairs and clearing the res list when we see a smaller diff.

where is greedy algorithm here ?

There is no need for using abs.

in the if segment lowestDiff = abs(nums[i+1]-nums[i]) we dont need abs as the list is already sorted

No need to keep adding and deleting to the result array. First the get the abs min difference. Then loop through the original array once again to figure out the pairs matching this diff. Much better then to do lots of copy and deletes.

But this code is not running as like of mine and showing the error as in mine :

Traceback (most recent call last): File "Solution.py", line 2, in nums = list(map(int,input().strip().split())) File "", line 1 -20 -3916237 -357920 -3620601 7374819 -7330761 30 6246457 -6461594 266854 ^ SyntaxError: invalid syntax

This is a cool optimization when doing two passes. Thanks for posting it!

I have written exact same code in java but test cases 3 and 4 are not passing. Please help me.

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    
    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */      Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int a[] = new int[n];
        for(int i=0;i<n;i++)
        {
            a[i] = sc.nextInt();
        }
        Arrays.sort(a);
        int d =a[1]-a[0],id=0;
        for(int i=1;i<n;i++)
        {
            if(d>Math.abs(a[i]-a[i-1]))
            {
                d = Math.abs(a[i]-a[i-1]);
                id = i-1;
            }
        }
        for(int i=id;i<n-1;i++)
        {
            if(d==Math.abs(a[i]-a[i+1]))
              System.out.print(a[i]+" "+a[i+1]);
        }
        
        
        
    }
}

better code

Thanks...!!! Even I came up with the same algorithm.

why do we need to find absolute value here?

this is nlogn

what happens if we dont do the sorting ?

Yes ,if there is such case we have to consider 0 also. But I think there is no such test case here:)