Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@esmadhan | 90 |

@senthil1185 | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

Given a sorted array **Arr **of size **N **and a number **X**, you need to find the number of occurrences of** X** in **Arr**.

**Example 1:**

**Input:
**N = 7, X = 2
Arr[] = {1, 1, 2, 2, 2, 2, 3}
**Output:** 4
**Explanation:** 2 occurs 4 times in the
given array.

**Example 2:**

**Input:
**N = 7, X = 4
Arr[] = {1, 1, 2, 2, 2, 2, 3}
**Output:** 0
**Explanation:** 4 is not present in the
given array.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **count()** which takes the array of integers **arr,** **n **and** x**** **as parameters and returns an integer denoting the answer.

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

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

**Constraints:**

1 ≤ N ≤ 10^{5}

1 ≤ Arr[i] ≤ 10^{6}

1 ≤ X ≤ 10^{6}

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
Number of occurrence

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.