Geeksforgeeks

Timer is Running

Associated Course(s):
Interview Preparation
Amazon SDE Test Series

You are given an array **A**, of **N** elements. Find minimum index based distance between two elements of the array, **x** and **y**.

**Example 1:**

**Input:
**N = 4
A[] = {1,2,3,2}
x = 1, y = 2
**Output: **1**
Explanation: **x = 1 and y = 2. There are
two distances between x and y, which are
1 and 3 out of which the least is 1.

**Example 2:**

**Input:
**N = 7
A[] = {86,39,90,67,84,66,62}
x = 42, y = 12
**Output: **-1**
Explanation: **x = 42 and y = 12. We return
-1 as x and y don't exist in the array.

**Your Task:**

Complete the function **minDist() **which takes the array, n, x and y as input parameters and returns the minimum distance between **x and y** in the array. If no such distance is possible then return **-1**.

**Expected Time Complexity:** O(N)

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 <= N <= 10^{5}

0 <= A[i], x, y <= 10^{5}

Author: saksham seth

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

jainshubham52535 | 529 |

Pathak1899 | 436 |

yashdip123 | 380 |

kirtidee18 | 377 |

jots62 | 351 |

kirtidee18 | 1057 |

ykaushik | 752 |

aggarwalvatsal5 | 741 |

harbilassingh | 576 |

pmr_3689 | 570 |

blackshadows | 5456 |

Ibrahim Nash | 5450 |

akhayrutdinov | 5111 |

mb1973 | 4976 |

Quandray | 4827 |

Login to report an issue on this page.