MinimumDistances.java

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;

class Result {
    
    public static int minimumDistances(List<Integer> a) {
    int minDistance = Integer.MAX_VALUE;
    Map<Integer,Integer> num = new HashMap<>();
    for(int i =0; i<a.size();i++){
        int distance = i;
        if(num.containsKey(a.get(i))){
            distance = Math.abs(i-num.get(a.get(i)));
            if(distance<minDistance){
                minDistance = distance;
            }
        }
        num.put(a.get(i),i);
    }
    return minDistance==Integer.MAX_VALUE?-1:minDistance;
    }

}

public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        int n = Integer.parseInt(bufferedReader.readLine().trim());

        List<Integer> a = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
            .map(Integer::parseInt)
            .collect(toList());

        int result = Result.minimumDistances(a);

        bufferedWriter.write(String.valueOf(result));
        bufferedWriter.newLine();

        bufferedReader.close();
        bufferedWriter.close();
    }
}