Grokking Binary Search for Coding Interviews_468 x 60 copy.png

Binary Search (BS) is, arguably, the most popular question in coding interviews. Even when you see that a problem can be solved with BS, it can be tricky to handle all of the indexes and base cases in the solution. What if there was an approach that could work for all BS problems? 
This course was designed from scratch with this one goal in mind. We'll explore one technique that can handle any BS problem. The practice problems in this course were carefully chosen to cover the most frequently asked BS questions in coding interviews. At the end of this course, you will feel confident to handle BS questions during phone or on-site interviews, as well as with all of the follow-ups about its time and space complexity.

Binary Search for Coding Interviews

# Problem statement

Suppose we are given a **sorted** array of integers, find the **number of occurrences** of a given **target value**. If the target is not found in the array, return `-1`.

**Constraints:**

-   $1 \leq nums.length \leq 10^4$
-   $-10^4 \leq nums[i] \leq 10^4$
-   $nums$ contains values sorted in an **ascending** order.
-   $-10^4 \leq target \leq 10^4$

**Example 1:**
```
Input: [5, 7, 7, 8, 8, 10], 8    
Output: 2
```

Let's try to count elements. This lesson is of medium-level difficulty.

__default

Element Occurrence

Problem statement