Introduction to Modified Binary Search Binary Search Search in Rotated Sorted Array First Bad Version Random Pick with Weight Find K Closest Elements Single Element in a Sorted Array Maximum Value at a Given Index in a Bounded Array The K Weakest Rows in a Matrix Split Array Largest Sum Find Minimum in Rotated Sorted Array II Maximum Running Time of N Computers Minimize Max Distance to Gas Station Divide Chocolate Search in Rotated Sorted Array II