Most Common Interview Problems on Binary Search
|
Problem Name |
Practice Link to the Problem |
|---|---|
|
Binary Search |
View |
|
Floor in a Sorted Array |
|
|
First and last occurrences of X |
View |
|
Peak element |
View |
|
Square root of a number |
View |
|
Koko Eating Bananas |
View |
|
Minimum days to make M bouquets |
|
|
Smallest Divisor |
|
|
Capacity To Ship Packages Within D Days |
View |
|
Aggressive Cows |
View |
|
Allocate minimum number of pages |
View |
|
Median of 2 Sorted Arrays of Different Sizes |
View |
How to Identify & Solve Binary Search Problems?
We all know that Binary search is the most efficient search algorithm as of now, and it has multiple applications in the programming domain for the same reason. But very often the problems do not have any information about applying Binary Search or even any hint on using a Searching algorithm altogether. So it becomes very important to have an understanding of how to identify Binary Search Problems, how to solve Binary Search problems and what are the most common interview questions that have a Binary Search solution involved. In this post, we have curated the topics to do just that.
Table of Content
- What is the Binary Search Technique?
- Possible Cases of problems and in which Case binary search can be applied or not:
- How to Identify Binary Search Problems?
- How to Solve Binary Search Problems?
- Example to show How to Identify & Solve a Problem using Binary search:
- Most Common Interview Problems on Binary Search