@@ -0,0 +1,1463 @@
+import java.io.*;%0Aimport java.math.*;%0Aimport java.security.*;%0Aimport java.text.*;%0Aimport java.util.*;%0Aimport java.util.concurrent.*;%0Aimport java.util.regex.*;%0A%0Apublic class Solution %7B%0A%0A    // Complete the minimumDistances function below.%0A    static int minimumDistances(int%5B%5D a) %7B%0A        ArrayList%3CInteger%3E myList = new ArrayList%3CInteger%3E();%0A        for(int i=0;i%3Ca.length-1;i++)%7B%0A            for(int j=i+1;j%3Ca.length;j++)%7B%0A                if(a%5Bi%5D==a%5Bj%5D)%7B%0A                    myList.add(Math.abs(i-j));%0A                %7D%0A            %7D%0A        %7D%0A        if(myList.size()==0) return -1;%0A        Collections.sort(myList);%0A        return myList.get(0);%0A    %7D%0A%0A    private static final Scanner scanner = new Scanner(System.in);%0A%0A    public static void main(String%5B%5D args) throws IOException %7B%0A        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(%22OUTPUT_PATH%22)));%0A%0A        int n = scanner.nextInt();%0A        scanner.skip(%22(%5Cr%5Cn%7C%5B%5Cn%5Cr%5Cu2028%5Cu2029%5Cu0085%5D)?%22);%0A%0A        int%5B%5D a = new int%5Bn%5D;%0A%0A        String%5B%5D aItems = scanner.nextLine().split(%22 %22);%0A        scanner.skip(%22(%5Cr%5Cn%7C%5B%5Cn%5Cr%5Cu2028%5Cu2029%5Cu0085%5D)?%22);%0A%0A        for (int i = 0; i %3C n; i++) %7B%0A            int aItem = Integer.parseInt(aItems%5Bi%5D);%0A            a%5Bi%5D = aItem;%0A        %7D%0A%0A        int result = minimumDistances(a);%0A%0A        bufferedWriter.write(String.valueOf(result));%0A        bufferedWriter.newLine();%0A%0A        bufferedWriter.close();%0A%0A        scanner.close();%0A    %7D%0A%7D%0A

add MinimumDistances.java