Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5604 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 799 |

@sriramgoparaju99 | 737 |

@Manikanta punnam | 629 |

@rdakka | 606 |

@prankursharma31 | 597 |

@praveenbgp6 | 546 |

@sanskar94511 | 531 |

@purohitmn02 | 529 |

@yashkaril4 | 517 |

@abhikarshgupta | 474 |

@rohitgarg2825 | 464 |

Complete Leaderboard |

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}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Minimum distance between two numbers

...