Find first and last position of a target in a sorted array

Approach

• Run binary search twice: once for the leftmost index, once for the rightmost.
• For left bound: when nums[mid] == target, record answer and move hi = mid - 1.
• For right bound: when equal, move lo = mid + 1.

Java Solution

public class FirstLastPosition {
    public static int[] searchRange(int[] nums, int target) {…