Find First and Last Position of Element in Sorted Array

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 1:Input: nums = [5,7,7,8,8,10], target = 8Output: [3,4]Example 2:Input: nums = [5,7,7,8,8,10], target = 6Output: [-1,-1]Example 3:Input: nums = [], target = 0Output: [-1,-1] Constraints:0 <= nums.length <= 105-109 <= nums[i] <= 109nums is a non-decreasing array.-109 <= target <= 109

How do you find the index of the first occurrence of an element in an array?Optionsfind(element)index(element)locate(element)search(element)

={INDEX(Data,MATCH(ROW(INDIRECT("1:"&ROWS(Data)))-1,COUNTIF(Data,"<" &Data),0))}Sorts the data from last to firstSorts the data alphabeticallyHighlights a number if it is less than DataGives the position of the least element in Data minus one

Remove Duplicates from Sorted Array

Given an unsorted array Arr[] of N integers and a Key which is present in this array. You need to write a program to find the start index( index where the element is first found from left in the array ) and end index( index where the element is first found from right in the array ).If the key does not exist in the array then return -1 for both start and end index in this case.