Search⌘ K
AI Features

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

Explore how to apply advanced binary search techniques to locate the first and last occurrences of a target element in a sorted array. This lesson helps you implement a solution that maintains logarithmic runtime by searching both bounds without scanning all elements, improving efficiency for coding interviews.

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) ...