Array First and Last Position LeetCode

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. If the target is not found in the array, return [-1, -1].

Your algorithm's runtime complexity must be in the order of O(log n).

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]

This is very popular interview question in LeetCode and GeeksForGeeks. A collection of hundreds of interview questions and solutions are available in our blog at Interview Question Solutions

Solution: