import java.util.Set;
import java.util.HashSet;
public class MyClass {
public static int findMininimumIndex(int[] arr) {
int minIndex = -1;
Set<Integer> set = new HashSet<>();
for (int i = arr.length - 1; i >= 0; i--) {
if (set.contains(arr[i])) {
minIndex = i;
}
else {
set.add(arr[i]);
}
}
return minIndex;
}
public static void main(String args[]) {
int[] arr = {3, 7, 8, 6, 9, 1, 8, 8, 6, 1, 1, 8};
System.out.print(findMininimumIndex(arr));
}
}
/*
run:
2
*/