8. Binary Search
EasyBinary search
Given a sorted array of distinct integers nums and a target, return the index of target, or -1 if it is not present. Aim for O(log n).
Example 1
Input: nums = [-1, 0, 3, 5, 9, 12], target = 9 Output: 4
Example 2
Input: nums = [-1, 0, 3, 5, 9, 12], target = 2 Output: -1
Constraints
1 ≤ nums.length ≤ 10⁴nums is sorted ascending