Search⌘ K
AI Features

Solution: Find First and Last Position of Element in Sorted Array

Explore how to efficiently locate the first and last occurrences of a target in a sorted array by applying modified binary search. Understand the step-by-step process to maintain O(log n) time complexity while handling boundary conditions for accurate indexing.

Statement

You are given an integer array, nums, that is sorted in non-decreasing order. Your task is to find the first and last indexes of a given value, target, within this array.

If the target does not appear in the array at all, return [-1, -1].

Note: You must write an algorithm with O(logn)O(\log n) ...