Find First and Last Position in Sorted Array
Tennr● MediumFULLTIMEPHONE SCREENProblem statement
You are given an integer array nums sorted in non-decreasing order and an integer target.
Return [first, last], the first and last index where target occurs. If it is absent, return [-1, -1].
Your algorithm must run in O(log n) time.
Function
searchRange(nums: int[], target: int) → int[]Examples
Example 1
nums = [5,7,7,8,8,10]target = 8return = [3,4]The target occupies indices 3 and 4.
Example 2
nums = [5,7,7,8,8,10]target = 6return = [-1,-1]The target is absent.
Constraints
0 <= nums.length <= 100000.-10^9 <= nums[i], target <= 10^9.numsis sorted in non-decreasing order.