Tap here to switch tabs
Problem
Submissions

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

Find First and Last Position of Element in Sorted Array asks you to return the first and last positions of a target value, or a pair of negative ones when it is absent.

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(log⁡n)O(\log n) runtime complexity.

Constraints:

  • 0≤0 \le nums.length ≤105\leq 10^5

  • −109≤-10^{9} \leq nums[i] ≤109\leq 10^{9}

  • nums is a non-decreasing array.

  • −109≤-10^{9} \leq target ≤109\leq 10^{9}

⋮
Tap here to switch tabs
Problem
Submissions

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

Find First and Last Position of Element in Sorted Array asks you to return the first and last positions of a target value, or a pair of negative ones when it is absent.

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(log⁡n)O(\log n) runtime complexity.

Constraints:

  • 0≤0 \le nums.length ≤105\leq 10^5

  • −109≤-10^{9} \leq nums[i] ≤109\leq 10^{9}

  • nums is a non-decreasing array.

  • −109≤-10^{9} \leq target ≤109\leq 10^{9}