Citadel Binary Search Questions
10 binary search problems asked at Citadel interviews
Easy (1)Medium (7)Hard (2)
Questions
| Title | Difficulty |
|---|---|
| Minimum Operations to Make Numbers Non-positive | Hard |
| Maximum Total Damage With Spell Casting | Medium |
| Maximum Length of Repeated Subarray | Medium |
| Find the Duplicate Number | Medium |
| Search Suggestions System | Medium |
| Median of Two Sorted Arrays | Hard |
| Sqrt(x) | Easy |
| Search a 2D Matrix II | Medium |
| Longest Increasing Subsequence | Medium |
| Koko Eating Bananas | Medium |
Showing 10 questions