Practice Find First and Last Position of Element in Sorted Array
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity.
Source: Find First and Last Position of Element in Sorted Array on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [5,7,7,8,8,10], target = 8
Output
[3,4]
# Example 2
Input
nums = [5,7,7,8,8,10], target = 6
Output
[-1,-1]
# Example 3
Input
nums = [], target = 0
Output
[-1,-1]
Constraints
0 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9
nums is a non-decreasing array.
-10^9 <= target <= 10^9
Related LeetCode Problems
Practice more problems similar to Find First and Last Position of Element in Sorted Array.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.