The correct, optimal and working solution for programming question minimum-distances on hackerrank

/* * Author: Arpit Bhayani * https://arpitbhayani.me */ #include <cmath> #include <cstdio> #include <cstdlib> #include <climits> #include <deque> #include <iostream> #include <list> #include <limits> #include <map> #include <queue> #include <set> #include <stack> #include <vector> #define ll long long #define MIN(a, b) a < b ? a : b #define MAX(a, b) a > b ? a : b using namespace std; int readline(char *str) { int i = 0; char ch; while((ch = getchar()) != '\n') { str[i++] = ch; } str[i] = '\0'; return i; } int arr[1010]; int main(int argc, char *argv[]) { int n; scanf("%d", &n); for(int i = 0 ; i < n ; i++) { scanf("%d", &arr[i]); } int dist = INT_MAX; for(int i = 0 ; i < n; i++) { for(int j = 0 ; j < i ; j++) { if(arr[i] == arr[j]) { dist = MIN(dist, abs(i - j)); } } } if(dist == INT_MAX) { dist = -1; } cout << dist << endl; return 0; }