How to solve First and Last Position in Sorted Array
Return the starting and ending indices of a target, or [-1,-1]. Binary-search separately for the left and right boundaries. The reference implementation illustrates this approach; check the example and edge cases.
Time and space complexity
O(log n) time and O(1) space.
Practise and improve
Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.