31. Find First and Last Position of Element in Sorted Array
MediumBinary Search
Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity.
Examples
Input: [5,7,7,8,8,10] 8
Output: [3,4]
Explanation: 8 first appears at index 3 and last at index 4.
Constraints
- 0 <= nums.length <= 10^5
- -10^9 <= nums[i] <= 10^9
- nums is a non-decreasing array.
- -10^9 <= target <= 10^9
Loading...
Run checks all cases above. Submit evaluates all test cases.