Find First and Last Position in Sorted Array — JavaScript Medium Coding Problem

// Find First and Last Position in Sorted Array — MEDIUM

// Category: binary-search

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.

Example: nums = [5,7,7,8,8,10], target = 8

Output: [3,4]

Find First and Last Position in Sorted Array — Pro only