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

How many elements will there be between the _left_ index and the _right_ index when we leave the while loop?

How many elements will there be between the left index and the right index when we leave the while loop?

What condition do we check for in the while statement?

What condition do we check for in the while statement?

What do we do if _nums[mid]<target_ and we need to search on the **right side**?

What do we do if nums[mid]&lt;target and we need to search on the right side?

What do we do if _nums[mid]>target_ and we need to search on the **left side**?

What do we do if nums[mid]&gt;target and we need to search on the left side?

What is the **time complexity** of our algorithm?


What is the time complexity of our algorithm?

What do we do if `nums[mid]` < target and `nums` is sorted in descending order?

What do we do if <code>nums[mid]</code> &lt; target and <code>nums</code> is sorted in descending order?

What do we do if `nums[mid]` > target and `nums` is sorted in descending order?


What do we do if <code>nums[mid]</code> &gt; target and <code>nums</code> is sorted in descending order?

Take a quiz to test your knowledge of our new approach to binary search problems. 

Final Quiz

Take a quiz to test your knowledge of our new approach to binary search problems.