Binary Search problems

Cutting a sorted (or sorted-like) search space in half, repeatedly.

1. Binary Search (Easy)
2. Search in Rotated Sorted Array (Medium)
3. Find Minimum in Rotated Sorted Array (Medium)
4. Search a 2D Matrix (Medium)
5. Koko Eating Bananas (Medium)
6. Time Based Key-Value Store (Medium)
7. Median of Two Sorted Arrays (Hard)