Accenture Binary Search Questions
11 binary search problems asked at Accenture interviews
Easy (2)Medium (8)Hard (1)
Questions
| Title | Difficulty |
|---|---|
| Koko Eating Bananas | Medium |
| Median of Two Sorted Arrays | Hard |
| Find Peak Element | Medium |
| Nth Digit | Medium |
| Intersection of Two Arrays | Easy |
| Find First and Last Position of Element in Sorted Array | Medium |
| Peak Index in a Mountain Array | Medium |
| Search Insert Position | Easy |
| Longest Increasing Subsequence | Medium |
| Search in Rotated Sorted Array II | Medium |
| Search in Rotated Sorted Array | Medium |
Showing 11 questions