Search⌘ K
AI Features

Find First and Last Position of Element in Sorted Array

Understand how to apply a modified binary search algorithm to identify the first and last positions of a target element in a sorted array. This lesson guides you through implementing an efficient O(log n) solution that handles edge cases and returns [-1, -1] if the element is not found.

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