Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5594 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 783 |

@Manikanta punnam | 605 |

@sriramgoparaju99 | 582 |

@rdakka | 534 |

@praveenbgp6 | 529 |

@prankursharma31 | 518 |

@yashkaril4 | 517 |

@purohitmn02 | 467 |

@sonamnigam1999 | 443 |

@sonamkumari63928 | 441 |

@shubhamstudent5 | 433 |

Complete Leaderboard |

Given a sorted array with possibly duplicate elements. The task is to find indexes of first and last occurrences of an element **X** in the given array.

**Note: **If the element is not present in the array **return {-1,-1} as pair**.

**Example 1:**

Input:N = 9 v[] = {1, 3, 5, 5, 5, 5, 67, 123, 125} X = 5Output:2 5Explanation:Index of first occurrence of 5 is 2 and index of last occurrence of 5 is 5.

**Example 2:**

**Input:**
N = 9
v[] = {1, 3, 5, 5, 5, 5, 7, 123, 125}
X = 7
**Output:**
6 6

**Your Task: **

You don't need to read input or print anything. Your task is to complete the function **indexes()** which takes the array **v[]**** **and an integer **X **as inputs and returns the first and last occurrence of the element **X**. If the element is not present in the array **return {-1,-1} as pair**.

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

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

**Constraints:**

1 ≤ N ≤ 10^{5}

1 ≤ v[], X ≤ 10^{18}

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
Left most and right most index

...